About the Execution of ITS-Tools for FireWire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3120.243 | 1011595.00 | 1159805.00 | 3387.60 | TFTFTTFFTFFTFFTF | 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-177955809000218.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000218
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.8K Mar 7 05:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 7 05:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 7 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 7 05:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 05:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Mar 7 05:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:07 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 101K 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-10-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779808370269
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 15:12:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 15:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 15:12:52] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2026-05-26 15:12:52] [INFO ] Transformed 131 places.
[2026-05-26 15:12:52] [INFO ] Transformed 409 transitions.
[2026-05-26 15:12:52] [INFO ] Found NUPN structural information;
[2026-05-26 15:12:52] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 89 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 131 transition count 347
Applied a total of 6 rules in 54 ms. Remains 131 /131 variables (removed 0) and now considering 347/353 (removed 6) transitions.
[2026-05-26 15:12:53] [INFO ] Flow matrix only has 321 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-9757530732042205465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12118397401236113585.kers'
[2026-05-26 15:12:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9757530732042205465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12118397401236113585.kers]
Normalized transition count is 320 out of 321 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 320 rows 131 cols 1101 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-26 15:12:53] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12118397401236113585.kers
Total runtime 5 ms.
[2026-05-26 15:12:53] [INFO ] Implicit Places using invariants in 555 ms returned []
[2026-05-26 15:12:53] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
[2026-05-26 15:12:53] [INFO ] Invariant cache hit.
[2026-05-26 15:12:54] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 15:12:54] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2026-05-26 15:12:54] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
[2026-05-26 15:12:54] [INFO ] Invariant cache hit.
[2026-05-26 15:12:54] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (OVERLAPS) 320/451 variables, 131/278 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 44/322 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 9 (OVERLAPS) 1/452 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/452 variables, and 323 constraints, problems are : Problem set: 0 solved, 346 unsolved in 30060 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (OVERLAPS) 320/451 variables, 131/278 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 44/322 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 346/668 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/452 variables, and 668 constraints, problems are : Problem set: 0 solved, 346 unsolved in 30032 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60713ms problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 60754ms
Starting structural reductions in LTL mode, iteration 1 : 131/131 places, 347/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62162 ms. Remains : 131/131 places, 347/353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Applied a total of 0 rules in 7 ms. Remains 131 /131 variables (removed 0) and now considering 347/347 (removed 0) transitions.
[2026-05-26 15:13:55] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
[2026-05-26 15:13:55] [INFO ] Invariant cache hit.
[2026-05-26 15:13:55] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-26 15:13:55] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
[2026-05-26 15:13:55] [INFO ] Invariant cache hit.
[2026-05-26 15:13:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 15:13:55] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 131/131 places, 347/347 transitions.
Support contains 89 out of 131 places after structural reductions.
[2026-05-26 15:13:56] [INFO ] Flatten gal took : 117 ms
[2026-05-26 15:13:56] [INFO ] Flatten gal took : 64 ms
[2026-05-26 15:13:56] [INFO ] Input system was already deterministic with 347 transitions.
Reduction of identical properties reduced properties to check from 97 to 93
RANDOM walk for 40000 steps (2235 resets) in 2551 ms. (15 steps per ms) remains 55/93 properties
BEST_FIRST walk for 4004 steps (59 resets) in 72 ms. (54 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (13 resets) in 45 ms. (87 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (22 resets) in 46 ms. (85 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (49 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 49/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (62 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (62 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (20 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (58 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (22 resets) in 50 ms. (78 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (62 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (45 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (54 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (55 resets) in 21 ms. (182 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (64 resets) in 12 ms. (308 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (103 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (73 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (70 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (44 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/49 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (53 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (17 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (59 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (51 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (88 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (55 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (36 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (107 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (66 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (146 resets) in 27 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (109 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (58 resets) in 27 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (61 resets) in 33 ms. (117 steps per ms) remains 43/43 properties
[2026-05-26 15:13:57] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
[2026-05-26 15:13:57] [INFO ] Invariant cache hit.
[2026-05-26 15:13:57] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem AtomicPropp71 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 42 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 2 (OVERLAPS) 69/129 variables, 8/68 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 69/137 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 8/145 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 320/449 variables, 129/274 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 44/318 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/318 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 2/451 variables, 2/320 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 2/322 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/322 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 1/452 variables, 1/323 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/323 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 0/452 variables, 0/323 constraints. Problems are: Problem set: 13 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 323 constraints, problems are : Problem set: 13 solved, 30 unsolved in 5012 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 89/129 variables, 8/48 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 89/137 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 8/145 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 320/449 variables, 129/274 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 44/318 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 27/345 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/345 constraints. Problems are: Problem set: 13 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 2/451 variables, 2/347 constraints. Problems are: Problem set: 13 solved, 30 unsolved
SMT process timed out in 10104ms, After SMT, problems are : Problem set: 13 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 347/347 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 131 transition count 344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 130 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 130 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 130 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 129 transition count 340
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 126 transition count 346
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 20 place count 126 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 126 transition count 337
Applied a total of 23 rules in 96 ms. Remains 126 /131 variables (removed 5) and now considering 337/347 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 126/131 places, 337/347 transitions.
RANDOM walk for 40000 steps (2204 resets) in 578 ms. (69 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4003 steps (59 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (57 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (64 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (51 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (68 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (54 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (55 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (110 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (74 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (56 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (56 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (62 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (46 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (55 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (46 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (101 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (55 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (148 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (116 resets) in 61 ms. (64 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (60 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 350514 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :19 out of 28
Probabilistic random walk after 350514 steps, saw 84607 distinct states, run finished after 3008 ms. (steps per millisecond=116 ) properties seen :19
[2026-05-26 15:14:11] [INFO ] Flow matrix only has 309 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17013242300026732348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2883375190311728001.kers'
[2026-05-26 15:14:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17013242300026732348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2883375190311728001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 126 cols 1067 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-26 15:14:11] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2883375190311728001.kers
Total runtime 2 ms.
[2026-05-26 15:14:11] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 79/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 28/123 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 309/432 variables, 123/133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 46/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 3/435 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/435 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 183 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 79/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 28/123 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 309/432 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 46/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 3/435 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/435 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 193 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2637 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4273ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 7359 ms.
Support contains 16 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 124 transition count 331
Applied a total of 6 rules in 30 ms. Remains 124 /126 variables (removed 2) and now considering 331/337 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 124/126 places, 331/337 transitions.
RANDOM walk for 40000 steps (2208 resets) in 279 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (552 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (64 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (25 resets) in 53 ms. (740 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (584 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (536 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (559 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (533 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (554 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (578 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
[2026-05-26 15:14:23] [INFO ] Flow matrix only has 303 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14241716890347462815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12853801875734684734.kers'
[2026-05-26 15:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14241716890347462815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12853801875734684734.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 303 rows 124 cols 1043 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-26 15:14:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12853801875734684734.kers
Total runtime 1 ms.
[2026-05-26 15:14:23] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 58/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 51/121 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 303/424 variables, 121/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 46/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/427 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/427 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 182 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1259 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 58/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 51/121 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 303/424 variables, 121/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 46/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 8/187 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3/427 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/427 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 191 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2660 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3936ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 29219 ms.
Support contains 12 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 331/331 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 123 transition count 330
Applied a total of 1 rules in 25 ms. Remains 123 /124 variables (removed 1) and now considering 330/331 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 123/124 places, 330/331 transitions.
RANDOM walk for 40000 steps (2316 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (556 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (59 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (595 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (550 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (593 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (549 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (532 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (588 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 416861 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 8
Probabilistic random walk after 416861 steps, saw 96060 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2026-05-26 15:15:00] [INFO ] Flow matrix only has 302 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9181145830672685986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17397266889250316337.kers'
[2026-05-26 15:15:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9181145830672685986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17397266889250316337.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 302 rows 121 cols 1027 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-26 15:15:00] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17397266889250316337.kers
Total runtime 2 ms.
[2026-05-26 15:15:00] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 57/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 256/325 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 96/421 variables, 50/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 22/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 4/425 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/425 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 176 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 57/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 256/325 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 96/421 variables, 50/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 22/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 4/425 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/425 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 186 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2580 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3609ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 5424 ms.
Support contains 12 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 330/330 transitions.
Applied a total of 0 rules in 12 ms. Remains 123 /123 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 123/123 places, 330/330 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 330/330 transitions.
Applied a total of 0 rules in 11 ms. Remains 123 /123 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2026-05-26 15:15:09] [INFO ] Flow matrix only has 302 transitions (discarded 28 similar events)
[2026-05-26 15:15:09] [INFO ] Invariant cache hit.
[2026-05-26 15:15:09] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-26 15:15:09] [INFO ] Flow matrix only has 302 transitions (discarded 28 similar events)
[2026-05-26 15:15:09] [INFO ] Invariant cache hit.
[2026-05-26 15:15:09] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 15:15:09] [INFO ] Implicit Places using invariants and state equation in 314 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 464 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 121/123 places, 330/330 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 328
Applied a total of 4 rules in 22 ms. Remains 119 /121 variables (removed 2) and now considering 328/330 (removed 2) transitions.
[2026-05-26 15:15:09] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2610421136417411357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17263209928914733831.kers'
[2026-05-26 15:15:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2610421136417411357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17263209928914733831.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 300 rows 119 cols 1025 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-26 15:15:09] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17263209928914733831.kers
Total runtime 1 ms.
[2026-05-26 15:15:09] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-26 15:15:09] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
[2026-05-26 15:15:09] [INFO ] Invariant cache hit.
[2026-05-26 15:15:09] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 15:15:10] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 119/123 places, 328/330 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1072 ms. Remains : 119/123 places, 328/330 transitions.
RANDOM walk for 40000 steps (2266 resets) in 374 ms. (106 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (556 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (77 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (504 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (583 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (562 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (582 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (498 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (567 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 462499 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 8
Probabilistic random walk after 462499 steps, saw 102287 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2026-05-26 15:15:13] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
[2026-05-26 15:15:13] [INFO ] Invariant cache hit.
[2026-05-26 15:15:13] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 57/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 256/325 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 94/419 variables, 50/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 22/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/419 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 170 constraints, problems are : Problem set: 0 solved, 8 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 57/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 256/325 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 94/419 variables, 50/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 22/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 178 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2599ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1611 ms.
Support contains 12 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 328/328 transitions.
Applied a total of 0 rules in 17 ms. Remains 119 /119 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 119/119 places, 328/328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 328/328 transitions.
Applied a total of 0 rules in 17 ms. Remains 119 /119 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2026-05-26 15:15:17] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
[2026-05-26 15:15:17] [INFO ] Invariant cache hit.
[2026-05-26 15:15:17] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-26 15:15:17] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
[2026-05-26 15:15:17] [INFO ] Invariant cache hit.
[2026-05-26 15:15:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 15:15:18] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2026-05-26 15:15:18] [INFO ] Redundant transitions in 39 ms returned []
Running 326 sub problems to find dead transitions.
[2026-05-26 15:15:18] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
[2026-05-26 15:15:18] [INFO ] Invariant cache hit.
[2026-05-26 15:15:18] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 300/418 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 1/419 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/419 variables, and 178 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 300/418 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 326/503 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/419 variables, and 507 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60779 ms. Remains : 119/119 places, 328/328 transitions.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-10-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 15:16:18] [INFO ] Flatten gal took : 28 ms
[2026-05-26 15:16:18] [INFO ] Flatten gal took : 28 ms
[2026-05-26 15:16:18] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 70 out of 131 places (down from 76) after GAL structural reductions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 127 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 126 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 126 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 125 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 125 transition count 331
Applied a total of 15 rules in 9 ms. Remains 125 /131 variables (removed 6) and now considering 331/347 (removed 16) transitions.
[2026-05-26 15:16:18] [INFO ] Flow matrix only has 305 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-4252340079101404806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2547994111217217614.kers'
[2026-05-26 15:16:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4252340079101404806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2547994111217217614.kers]
Normalized transition count is 304 out of 305 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 125 cols 1041 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-26 15:16:18] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2547994111217217614.kers
Total runtime 2 ms.
[2026-05-26 15:16:18] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-26 15:16:18] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2026-05-26 15:16:18] [INFO ] Invariant cache hit.
[2026-05-26 15:16:19] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 15:16:19] [INFO ] Implicit Places using invariants and state equation in 337 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 453 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/131 places, 331/347 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 464 ms. Remains : 123/131 places, 331/347 transitions.
[2026-05-26 15:16:19] [INFO ] Flatten gal took : 25 ms
[2026-05-26 15:16:19] [INFO ] Flatten gal took : 19 ms
[2026-05-26 15:16:19] [INFO ] Input system was already deterministic with 331 transitions.
[2026-05-26 15:16:19] [INFO ] Flatten gal took : 19 ms
[2026-05-26 15:16:19] [INFO ] Flatten gal took : 21 ms
[2026-05-26 15:16:19] [INFO ] Time to serialize gal into /tmp/CTLFireability5118259879860557816.gal : 13 ms
[2026-05-26 15:16:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4700273002097537033.ctl : 6 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5118259879860557816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4700273002097537033.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17805e+07,2.12183,46976,2,2814,5,121714,6,0,822,129400,0
Converting to forward existential form...Done !
original formula: AX(EF((AG(((p9==0)||(p119==0))) * ((p8==0)||(p37==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (!(E(TRUE U !(((p9==0)||(p119==0))))) * ((p8==0)||(p37==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...699
(forward)formula 0,1,16.0085,310096,1,0,703,1.54015e+06,682,358,6910,1.05287e+06,804
FORMULA FireWire-PT-10-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 122 transition count 326
Applied a total of 19 rules in 35 ms. Remains 122 /131 variables (removed 9) and now considering 326/347 (removed 21) transitions.
[2026-05-26 15:16:35] [INFO ] Flow matrix only has 300 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-11326709396895279501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3218586649610525157.kers'
[2026-05-26 15:16:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11326709396895279501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3218586649610525157.kers]
Normalized transition count is 299 out of 300 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 299 rows 120 cols 1013 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-26 15:16:35] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3218586649610525157.kers
Total runtime 3 ms.
[2026-05-26 15:16:35] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-26 15:16:35] [INFO ] Flow matrix only has 300 transitions (discarded 26 similar events)
[2026-05-26 15:16:35] [INFO ] Invariant cache hit.
[2026-05-26 15:16:36] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 15:16:36] [INFO ] Implicit Places using invariants and state equation in 426 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 605 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 121/131 places, 326/347 transitions.
Applied a total of 0 rules in 13 ms. Remains 121 /121 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 655 ms. Remains : 121/131 places, 326/347 transitions.
[2026-05-26 15:16:36] [INFO ] Flatten gal took : 35 ms
[2026-05-26 15:16:36] [INFO ] Flatten gal took : 31 ms
[2026-05-26 15:16:36] [INFO ] Input system was already deterministic with 326 transitions.
[2026-05-26 15:16:36] [INFO ] Flatten gal took : 16 ms
[2026-05-26 15:16:36] [INFO ] Flatten gal took : 16 ms
[2026-05-26 15:16:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15326933664949007483.gal : 7 ms
[2026-05-26 15:16:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13543570404631901752.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15326933664949007483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13543570404631901752.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.62992e+06,2.30689,47972,2,2556,5,122828,6,0,809,140923,0
Converting to forward existential form...Done !
original formula: E(AG(EF((!(AF(((p8==1)&&(p33==1)))) * A(((p4==1)&&(p82==1)) U ((p8==1)&&(p59==1)))))) U AG(((((p6==1)&&(p37==1))||((p9==1)&&(p23==1)))||(...177
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(E(TRUE U (!(!(EG(!(((p8==1)&&(p33==1)))))) * !((E(!(((p8==1)&&(p59==1))) U (!(((p4==1)&...326
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...682
(forward)formula 0,0,4.47598,75124,1,0,584,317794,671,298,6698,283364,659
FORMULA FireWire-PT-10-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 343
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 129 transition count 341
Applied a total of 6 rules in 7 ms. Remains 129 /131 variables (removed 2) and now considering 341/347 (removed 6) transitions.
[2026-05-26 15:16:41] [INFO ] Flow matrix only has 315 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-11541106571935795332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10134496244821160096.kers'
[2026-05-26 15:16:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11541106571935795332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10134496244821160096.kers]
Normalized transition count is 314 out of 315 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 129 cols 1077 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-26 15:16:41] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10134496244821160096.kers
Total runtime 4 ms.
[2026-05-26 15:16:41] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-26 15:16:41] [INFO ] Flow matrix only has 315 transitions (discarded 26 similar events)
[2026-05-26 15:16:41] [INFO ] Invariant cache hit.
[2026-05-26 15:16:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 15:16:41] [INFO ] Implicit Places using invariants and state equation in 646 ms returned [13, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 904 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/131 places, 341/347 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 916 ms. Remains : 127/131 places, 341/347 transitions.
[2026-05-26 15:16:41] [INFO ] Flatten gal took : 23 ms
[2026-05-26 15:16:41] [INFO ] Flatten gal took : 22 ms
[2026-05-26 15:16:42] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-26 15:16:42] [INFO ] Flatten gal took : 18 ms
[2026-05-26 15:16:42] [INFO ] Flatten gal took : 22 ms
[2026-05-26 15:16:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3884200786031148016.gal : 6 ms
[2026-05-26 15:16:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10721820463324784171.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3884200786031148016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10721820463324784171.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21734e+07,3.3364,74124,2,2949,5,216141,6,0,848,212686,0
Converting to forward existential form...Done !
original formula: E((!((!(EF((((p40==1)&&(p53==1))&&((p8==1)&&(p107==1))))) + (AF((((p5==1)&&(p26==1))||(p31==1))) * EF(!(((p71==1)&&(p78==1))))))) * !(A((...434
=> equivalent forward existential formula: [((FwdU(Init,(!((!(E(TRUE U (((p40==1)&&(p53==1))&&((p8==1)&&(p107==1))))) + (!(EG(!((((p5==1)&&(p26==1))||(p31=...656
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t18, t20, t24, t25, t27, t28, t30, t32, t36, t37,...718
Detected timeout of ITS tools.
[2026-05-26 15:17:12] [INFO ] Flatten gal took : 14 ms
[2026-05-26 15:17:12] [INFO ] Applying decomposition
[2026-05-26 15:17:12] [INFO ] Flatten gal took : 14 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/graph14685959777533362259.txt' '-o' '/tmp/graph14685959777533362259.bin' '-w' '/tmp/graph14685959777533362259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14685959777533362259.bin' '-l' '-1' '-v' '-w' '/tmp/graph14685959777533362259.weights' '-q' '0' '-e' '0.001'
[2026-05-26 15:17:12] [INFO ] Decomposing Gal with order
[2026-05-26 15:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:17:12] [INFO ] Removed a total of 549 redundant transitions.
[2026-05-26 15:17:12] [INFO ] Flatten gal took : 269 ms
[2026-05-26 15:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 71 ms.
[2026-05-26 15:17:13] [INFO ] Time to serialize gal into /tmp/CTLFireability650069710618001989.gal : 10 ms
[2026-05-26 15:17:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5788735820647071034.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability650069710618001989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5788735820647071034.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21734e+07,6.18095,122168,1977,101,207428,931,652,447594,85,4582,0
Converting to forward existential form...Done !
original formula: E((!((!(EF((((i0.i1.u11.p40==1)&&(i3.u16.p53==1))&&((i3.u2.p8==1)&&(i7.u44.p107==1))))) + (AF((((i6.u1.p5==1)&&(i6.u4.p26==1))||(i1.u10.p...686
=> equivalent forward existential formula: [((FwdU(Init,(!((!(E(TRUE U (((i0.i1.u11.p40==1)&&(i3.u16.p53==1))&&((i3.u2.p8==1)&&(i7.u44.p107==1))))) + (!(EG...970
Reverse transition relation is NOT exact ! Due to transitions t7, t40, t43, t46, t47, t49, t57, t62, t67, t72, t77, t85, t92, t97, t134, t135, t136, t138, ...853
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 114 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 113 transition count 305
Applied a total of 37 rules in 81 ms. Remains 113 /131 variables (removed 18) and now considering 305/347 (removed 42) transitions.
[2026-05-26 15:17:43] [INFO ] Flow matrix only has 279 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-5124736744127542131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2948027150604573817.kers'
[2026-05-26 15:17:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5124736744127542131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2948027150604573817.kers]
Normalized transition count is 278 out of 279 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 278 rows 111 cols 935 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-26 15:17:43] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2948027150604573817.kers
Total runtime 2 ms.
[2026-05-26 15:17:43] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-26 15:17:43] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2026-05-26 15:17:43] [INFO ] Invariant cache hit.
[2026-05-26 15:17:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 15:17:43] [INFO ] Implicit Places using invariants and state equation in 329 ms returned [12, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 454 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/131 places, 305/347 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 544 ms. Remains : 111/131 places, 305/347 transitions.
[2026-05-26 15:17:43] [INFO ] Flatten gal took : 10 ms
[2026-05-26 15:17:43] [INFO ] Flatten gal took : 12 ms
[2026-05-26 15:17:43] [INFO ] Input system was already deterministic with 305 transitions.
[2026-05-26 15:17:43] [INFO ] Flatten gal took : 28 ms
[2026-05-26 15:17:43] [INFO ] Flatten gal took : 15 ms
[2026-05-26 15:17:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15979134303531892734.gal : 5 ms
[2026-05-26 15:17:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2919693509458772613.prop : 15 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15979134303531892734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2919693509458772613.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 30475 steps (1733 resets) in 224 ms. (135 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 127 transition count 336
Applied a total of 11 rules in 4 ms. Remains 127 /131 variables (removed 4) and now considering 336/347 (removed 11) transitions.
[2026-05-26 15:17:43] [INFO ] Flow matrix only has 310 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-4084098861856061775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11641325841908091467.kers'
[2026-05-26 15:17:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4084098861856061775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11641325841908091467.kers]
Normalized transition count is 309 out of 310 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 127 cols 1059 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-26 15:17:43] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11641325841908091467.kers
Total runtime 3 ms.
[2026-05-26 15:17:44] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-26 15:17:44] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2026-05-26 15:17:44] [INFO ] Invariant cache hit.
[2026-05-26 15:17:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 15:17:44] [INFO ] Implicit Places using invariants and state equation in 354 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 651 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/131 places, 336/347 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 336/336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 657 ms. Remains : 125/131 places, 336/347 transitions.
[2026-05-26 15:17:44] [INFO ] Flatten gal took : 17 ms
[2026-05-26 15:17:44] [INFO ] Flatten gal took : 9 ms
[2026-05-26 15:17:44] [INFO ] Input system was already deterministic with 336 transitions.
[2026-05-26 15:17:44] [INFO ] Flatten gal took : 8 ms
[2026-05-26 15:17:44] [INFO ] Flatten gal took : 9 ms
[2026-05-26 15:17:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6556786605234885570.gal : 3 ms
[2026-05-26 15:17:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4901550440749233474.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6556786605234885570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4901550440749233474.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,2.75947,68868,2,2820,5,202226,6,0,835,209509,0
Converting to forward existential form...Done !
original formula: EF(((AG(AX(((p8==1)&&(p114==1)))) + (p105==1)) + ((p3==1)&&(p117==1))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(((p8==1)&&(p114==1)))))))))] != FALSE + [(FwdU(Init,TRUE) * (p105==1))...221
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...712
(forward)formula 0,1,5.3624,90296,1,0,613,375778,691,312,7042,334922,683
FORMULA FireWire-PT-10-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 114 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 113 transition count 305
Applied a total of 37 rules in 47 ms. Remains 113 /131 variables (removed 18) and now considering 305/347 (removed 42) transitions.
[2026-05-26 15:17:50] [INFO ] Flow matrix only has 279 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-16855336234215023810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15006779130466299082.kers'
[2026-05-26 15:17:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16855336234215023810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15006779130466299082.kers]
Normalized transition count is 278 out of 279 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 278 rows 111 cols 935 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-26 15:17:50] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15006779130466299082.kers
Total runtime 1 ms.
[2026-05-26 15:17:50] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-26 15:17:50] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2026-05-26 15:17:50] [INFO ] Invariant cache hit.
[2026-05-26 15:17:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 15:17:50] [INFO ] Implicit Places using invariants and state equation in 353 ms returned [12, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 454 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/131 places, 305/347 transitions.
Applied a total of 0 rules in 16 ms. Remains 111 /111 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 517 ms. Remains : 111/131 places, 305/347 transitions.
[2026-05-26 15:17:50] [INFO ] Flatten gal took : 10 ms
[2026-05-26 15:17:50] [INFO ] Flatten gal took : 11 ms
[2026-05-26 15:17:50] [INFO ] Input system was already deterministic with 305 transitions.
[2026-05-26 15:17:50] [INFO ] Flatten gal took : 27 ms
[2026-05-26 15:17:50] [INFO ] Flatten gal took : 23 ms
[2026-05-26 15:17:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5127516046274595025.gal : 8 ms
[2026-05-26 15:17:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8247381641035898341.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5127516046274595025.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8247381641035898341.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (2362 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (589 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality8247381641035898341.prop.
Finished probabilistic random walk after 2370 steps, run visited all 1 properties in 18 ms. (steps per millisecond=131 )
Probabilistic random walk after 2370 steps, saw 1417 distinct states, run finished after 30 ms. (steps per millisecond=79 ) properties seen :1
FORMULA FireWire-PT-10-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 128 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 128 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 128 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 127 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 127 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 126 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 126 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 125 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 125 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 124 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 124 transition count 329
Applied a total of 16 rules in 13 ms. Remains 124 /131 variables (removed 7) and now considering 329/347 (removed 18) transitions.
[2026-05-26 15:17:50] [INFO ] Flow matrix only has 303 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-16365471651548737645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10598352412477633620.kers'
[2026-05-26 15:17:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16365471651548737645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10598352412477633620.kers]
Normalized transition count is 302 out of 303 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 302 rows 124 cols 1035 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-26 15:17:50] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10598352412477633620.kers
Total runtime 4 ms.
[2026-05-26 15:17:51] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-26 15:17:51] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2026-05-26 15:17:51] [INFO ] Invariant cache hit.
[2026-05-26 15:17:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:17:51] [INFO ] Implicit Places using invariants and state equation in 465 ms returned [13, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 625 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/131 places, 329/347 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 641 ms. Remains : 122/131 places, 329/347 transitions.
[2026-05-26 15:17:51] [INFO ] Flatten gal took : 11 ms
[2026-05-26 15:17:51] [INFO ] Flatten gal took : 13 ms
[2026-05-26 15:17:51] [INFO ] Input system was already deterministic with 329 transitions.
[2026-05-26 15:17:51] [INFO ] Flatten gal took : 23 ms
[2026-05-26 15:17:51] [INFO ] Flatten gal took : 13 ms
[2026-05-26 15:17:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15122014725478322440.gal : 4 ms
[2026-05-26 15:17:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17023882669099743460.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15122014725478322440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17023882669099743460.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20675e+07,2.38224,47344,2,2939,5,121796,6,0,816,123692,0
Converting to forward existential form...Done !
original formula: (E(((EF(((p10==1)&&(p105==1))) * (p8==1)) * (p104==1)) U EF(((E((p10==1) U ((p3==1)&&(p83==1))) * (p10==1)) * (p128==1)))) + (EF(((p11==1...228
=> equivalent forward existential formula: ([((Init * !(E(((E(TRUE U ((p10==1)&&(p105==1))) * (p8==1)) * (p104==1)) U E(TRUE U ((E((p10==1) U ((p3==1)&&(p8...463
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...693
(forward)formula 0,0,14.468,280916,1,0,668,1.31501e+06,695,354,7027,958460,793
FORMULA FireWire-PT-10-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 128 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 128 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 128 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 127 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 127 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 126 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 126 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 125 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 125 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 124 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 124 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 123 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 123 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 122 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 122 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 121 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 121 transition count 321
Applied a total of 22 rules in 23 ms. Remains 121 /131 variables (removed 10) and now considering 321/347 (removed 26) transitions.
[2026-05-26 15:18:06] [INFO ] Flow matrix only has 295 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-1906807344349472163.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16982035682715090542.kers'
[2026-05-26 15:18:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1906807344349472163.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16982035682715090542.kers]
Normalized transition count is 294 out of 295 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 294 rows 121 cols 1007 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-26 15:18:06] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16982035682715090542.kers
Total runtime 3 ms.
[2026-05-26 15:18:06] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-26 15:18:06] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2026-05-26 15:18:06] [INFO ] Invariant cache hit.
[2026-05-26 15:18:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 15:18:06] [INFO ] Implicit Places using invariants and state equation in 491 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 703 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/131 places, 321/347 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 727 ms. Remains : 119/131 places, 321/347 transitions.
[2026-05-26 15:18:06] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:18:06] [INFO ] Flatten gal took : 8 ms
[2026-05-26 15:18:06] [INFO ] Input system was already deterministic with 321 transitions.
[2026-05-26 15:18:06] [INFO ] Flatten gal took : 8 ms
[2026-05-26 15:18:06] [INFO ] Flatten gal took : 8 ms
[2026-05-26 15:18:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8042149750034529507.gal : 3 ms
[2026-05-26 15:18:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3848543689087910804.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8042149750034529507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3848543689087910804.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18261e+07,2.21387,46124,2,2922,5,117693,6,0,796,120829,0
Converting to forward existential form...Done !
original formula: (AX(AF(!(E(((p8==1)&&(p38==1)) U ((p11==1)&&(p76==1)))))) * ((AF(AG(((p8==0)||(p130==0)))) + A((EG(((p4==1)&&(p86==1))) + EF(((p5==1)&&(p...292
=> equivalent forward existential formula: ([FwdG(EY(Init),!(!(E(((p8==1)&&(p38==1)) U ((p11==1)&&(p76==1))))))] = FALSE * (([(FwdU(FwdU((Init * !((!(EG(!(...1352
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...670
Detected timeout of ITS tools.
[2026-05-26 15:18:37] [INFO ] Flatten gal took : 8 ms
[2026-05-26 15:18:37] [INFO ] Applying decomposition
[2026-05-26 15:18:37] [INFO ] Flatten gal took : 8 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/graph12552231209114827920.txt' '-o' '/tmp/graph12552231209114827920.bin' '-w' '/tmp/graph12552231209114827920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12552231209114827920.bin' '-l' '-1' '-v' '-w' '/tmp/graph12552231209114827920.weights' '-q' '0' '-e' '0.001'
[2026-05-26 15:18:37] [INFO ] Decomposing Gal with order
[2026-05-26 15:18:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:18:37] [INFO ] Removed a total of 507 redundant transitions.
[2026-05-26 15:18:37] [INFO ] Flatten gal took : 38 ms
[2026-05-26 15:18:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 28 ms.
[2026-05-26 15:18:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8234957869759558075.gal : 13 ms
[2026-05-26 15:18:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4256301910235666325.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8234957869759558075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4256301910235666325.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 127 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 126 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 126 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 125 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 125 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 124 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 124 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 123 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 123 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 122 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 122 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 121 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 121 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 120 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 120 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 119 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 119 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 118 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 118 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 117 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 117 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 115 transition count 307
Applied a total of 35 rules in 15 ms. Remains 115 /131 variables (removed 16) and now considering 307/347 (removed 40) transitions.
[2026-05-26 15:19:07] [INFO ] Flow matrix only has 281 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-9410953210886762265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8148815898234239131.kers'
[2026-05-26 15:19:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9410953210886762265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8148815898234239131.kers]
Normalized transition count is 280 out of 281 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 115 cols 953 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 15:19:07] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8148815898234239131.kers
Total runtime 2 ms.
[2026-05-26 15:19:07] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-26 15:19:07] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2026-05-26 15:19:07] [INFO ] Invariant cache hit.
[2026-05-26 15:19:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:19:07] [INFO ] Implicit Places using invariants and state equation in 271 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 382 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/131 places, 307/347 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 400 ms. Remains : 113/131 places, 307/347 transitions.
[2026-05-26 15:19:07] [INFO ] Flatten gal took : 12 ms
[2026-05-26 15:19:07] [INFO ] Flatten gal took : 12 ms
[2026-05-26 15:19:07] [INFO ] Input system was already deterministic with 307 transitions.
[2026-05-26 15:19:07] [INFO ] Flatten gal took : 11 ms
[2026-05-26 15:19:07] [INFO ] Flatten gal took : 11 ms
[2026-05-26 15:19:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8898092859074689340.gal : 3 ms
[2026-05-26 15:19:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9178315127876995788.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8898092859074689340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9178315127876995788.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,9.03254,185112,2,6965,5,477294,6,0,758,637251,0
Converting to forward existential form...Done !
original formula: (EF((AG(EX(((p8==0)||(p64==0)))) + E(AX(((p6==1)&&(p103==1))) U EF(((p3==1)&&(p45==1)))))) + AF(AG(EF((AX(((p10==1)&&(p31==1))) * AG(((p8...177
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (!(E(TRUE U !(EX(((p8==0)||(p64==0)))))) + E(!(EX(!(((p6==1)&&(p103==1))))) U E(TRUE U ...291
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...639
Detected timeout of ITS tools.
[2026-05-26 15:19:37] [INFO ] Flatten gal took : 8 ms
[2026-05-26 15:19:37] [INFO ] Applying decomposition
[2026-05-26 15:19:37] [INFO ] Flatten gal took : 8 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/graph7199513628545104655.txt' '-o' '/tmp/graph7199513628545104655.bin' '-w' '/tmp/graph7199513628545104655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7199513628545104655.bin' '-l' '-1' '-v' '-w' '/tmp/graph7199513628545104655.weights' '-q' '0' '-e' '0.001'
[2026-05-26 15:19:37] [INFO ] Decomposing Gal with order
[2026-05-26 15:19:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:19:38] [INFO ] Removed a total of 480 redundant transitions.
[2026-05-26 15:19:38] [INFO ] Flatten gal took : 22 ms
[2026-05-26 15:19:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 14 ms.
[2026-05-26 15:19:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13305426355534804968.gal : 3 ms
[2026-05-26 15:19:38] [INFO ] Time to serialize properties into /tmp/CTLFireability5736070525089355021.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13305426355534804968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5736070525089355021.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,7.01924,130608,2359,239,159637,1556,635,752138,86,15408,0
Converting to forward existential form...Done !
original formula: (EF((AG(EX(((i3.u2.p8==0)||(i3.u20.p64==0)))) + E(AX(((i5.i1.u37.p6==1)&&(i6.u35.p103==1))) U EF(((i0.u0.p3==1)&&(i3.u20.p45==1)))))) + A...249
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (!(E(TRUE U !(EX(((i3.u2.p8==0)||(i3.u20.p64==0)))))) + E(!(EX(!(((i5.i1.u37.p6==1)&&(i...363
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t79, t91, t94, t133, t134, t135, t...782
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 114 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 113 transition count 305
Applied a total of 37 rules in 41 ms. Remains 113 /131 variables (removed 18) and now considering 305/347 (removed 42) transitions.
[2026-05-26 15:20:08] [INFO ] Flow matrix only has 279 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-3751095566686390946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9054467900396232263.kers'
[2026-05-26 15:20:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3751095566686390946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9054467900396232263.kers]
Normalized transition count is 278 out of 279 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 278 rows 111 cols 935 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-26 15:20:08] [INFO ] Computed 8 invariants in 4 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9054467900396232263.kers
Total runtime 5 ms.
[2026-05-26 15:20:08] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-26 15:20:08] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2026-05-26 15:20:08] [INFO ] Invariant cache hit.
[2026-05-26 15:20:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 15:20:08] [INFO ] Implicit Places using invariants and state equation in 314 ms returned [12, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 474 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/131 places, 305/347 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 528 ms. Remains : 111/131 places, 305/347 transitions.
[2026-05-26 15:20:08] [INFO ] Flatten gal took : 12 ms
[2026-05-26 15:20:08] [INFO ] Flatten gal took : 10 ms
[2026-05-26 15:20:08] [INFO ] Input system was already deterministic with 305 transitions.
[2026-05-26 15:20:08] [INFO ] Flatten gal took : 12 ms
[2026-05-26 15:20:08] [INFO ] Flatten gal took : 11 ms
[2026-05-26 15:20:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5605049666830588327.gal : 3 ms
[2026-05-26 15:20:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2728157139560283551.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5605049666830588327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2728157139560283551.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.44654e+06,5.62272,116880,2,5782,5,304347,6,0,748,391545,0
Converting to forward existential form...Done !
original formula: EG(EF(AG(((p8==1)&&(p30==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((p8==1)&&(p30==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...633
(forward)formula 0,0,9.83053,135604,1,0,539,567423,635,278,6404,496620,619
FORMULA FireWire-PT-10-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 128 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 128 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 128 transition count 338
Applied a total of 9 rules in 4 ms. Remains 128 /131 variables (removed 3) and now considering 338/347 (removed 9) transitions.
[2026-05-26 15:20:18] [INFO ] Flow matrix only has 312 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-9213526901675040902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14762552212790924669.kers'
[2026-05-26 15:20:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9213526901675040902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14762552212790924669.kers]
Normalized transition count is 311 out of 312 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 128 cols 1065 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-26 15:20:18] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14762552212790924669.kers
Total runtime 3 ms.
[2026-05-26 15:20:18] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-26 15:20:18] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2026-05-26 15:20:18] [INFO ] Invariant cache hit.
[2026-05-26 15:20:19] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 15:20:19] [INFO ] Implicit Places using invariants and state equation in 365 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 562 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/131 places, 338/347 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 568 ms. Remains : 126/131 places, 338/347 transitions.
[2026-05-26 15:20:19] [INFO ] Flatten gal took : 6 ms
[2026-05-26 15:20:19] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:20:19] [INFO ] Input system was already deterministic with 338 transitions.
[2026-05-26 15:20:19] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:20:19] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:20:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14862284775911692223.gal : 2 ms
[2026-05-26 15:20:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16765218683319892844.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14862284775911692223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16765218683319892844.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18424e+07,3.23646,68760,2,2856,5,202264,6,0,841,206114,0
Converting to forward existential form...Done !
original formula: EX(((EX(AX(((p78==1)||((p6==1)&&(p32==1))))) + (p8==0)) + (p64==0)))
=> equivalent forward existential formula: (([(EY(EY(Init)) * !(EX(!(((p78==1)||((p6==1)&&(p32==1)))))))] != FALSE + [(EY(Init) * (p8==0))] != FALSE) + [(E...185
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t18, t20, t24, t25, t27, t28, t30, t32, t36, t37,...712
(forward)formula 0,1,4.9957,69820,1,0,614,283494,691,313,7068,274909,683
FORMULA FireWire-PT-10-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 128 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 128 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 128 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 127 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 127 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 126 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 126 transition count 334
Applied a total of 12 rules in 5 ms. Remains 126 /131 variables (removed 5) and now considering 334/347 (removed 13) transitions.
[2026-05-26 15:20:24] [INFO ] Flow matrix only has 308 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-11061473426708214131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12191134685537889419.kers'
[2026-05-26 15:20:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11061473426708214131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12191134685537889419.kers]
Normalized transition count is 307 out of 308 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 126 cols 1053 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-26 15:20:24] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12191134685537889419.kers
Total runtime 2 ms.
[2026-05-26 15:20:24] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-26 15:20:24] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
[2026-05-26 15:20:24] [INFO ] Invariant cache hit.
[2026-05-26 15:20:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 15:20:24] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2026-05-26 15:20:24] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
[2026-05-26 15:20:24] [INFO ] Invariant cache hit.
[2026-05-26 15:20:24] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 307/433 variables, 126/142 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 43/185 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (OVERLAPS) 0/434 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 186 constraints, problems are : Problem set: 0 solved, 333 unsolved in 29479 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 307/433 variables, 126/142 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 43/185 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 333/518 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/434 variables, and 520 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 43/44 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59637ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 59638ms
Starting structural reductions in LTL mode, iteration 1 : 126/131 places, 334/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60087 ms. Remains : 126/131 places, 334/347 transitions.
[2026-05-26 15:21:24] [INFO ] Flatten gal took : 11 ms
[2026-05-26 15:21:24] [INFO ] Flatten gal took : 12 ms
[2026-05-26 15:21:24] [INFO ] Input system was already deterministic with 334 transitions.
[2026-05-26 15:21:24] [INFO ] Flatten gal took : 12 ms
[2026-05-26 15:21:24] [INFO ] Flatten gal took : 11 ms
[2026-05-26 15:21:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1966833104454709100.gal : 3 ms
[2026-05-26 15:21:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13517040798834079298.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1966833104454709100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13517040798834079298.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19284e+07,12.3874,233868,2,9185,5,593022,6,0,837,741998,0
Converting to forward existential form...Done !
original formula: (EG(((((E(!(((p7==1)&&(p115==1))) U ((p4==1)&&(p25==1))) * EF(((p8==1)&&(p58==1)))) + ((EG(((p10==0)||(p94==0))) * ((p10==0)||(p99==0))) ...666
=> equivalent forward existential formula: [(((Init * EG(((((E(!(((p7==1)&&(p115==1))) U ((p4==1)&&(p25==1))) * E(TRUE U ((p8==1)&&(p58==1)))) + ((EG(((p10...1949
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...705
Detected timeout of ITS tools.
[2026-05-26 15:21:54] [INFO ] Flatten gal took : 9 ms
[2026-05-26 15:21:54] [INFO ] Applying decomposition
[2026-05-26 15:21:54] [INFO ] Flatten gal took : 7 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/graph5405362582016035801.txt' '-o' '/tmp/graph5405362582016035801.bin' '-w' '/tmp/graph5405362582016035801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5405362582016035801.bin' '-l' '-1' '-v' '-w' '/tmp/graph5405362582016035801.weights' '-q' '0' '-e' '0.001'
[2026-05-26 15:21:54] [INFO ] Decomposing Gal with order
[2026-05-26 15:21:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:21:54] [INFO ] Removed a total of 531 redundant transitions.
[2026-05-26 15:21:54] [INFO ] Flatten gal took : 32 ms
[2026-05-26 15:21:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 13 ms.
[2026-05-26 15:21:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14181757605327528120.gal : 3 ms
[2026-05-26 15:21:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4665795220849945290.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14181757605327528120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4665795220849945290.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19284e+07,18.4599,307420,2763,222,356925,4079,694,1.82261e+06,89,40256,0
Converting to forward existential form...Done !
original formula: (EG(((((E(!(((i2.u2.p7==1)&&(i5.i2.u40.p115==1))) U ((i1.i2.u1.p4==1)&&(i1.i1.u8.p25==1))) * EF(((i2.u2.p8==1)&&(i4.u20.p58==1)))) + ((EG...1065
=> equivalent forward existential formula: [(((Init * EG(((((E(!(((i2.u2.p7==1)&&(i5.i2.u40.p115==1))) U ((i1.i2.u1.p4==1)&&(i1.i1.u8.p25==1))) * E(TRUE U ...3006
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t55, t56, t61, t66, t71, t76, t88, t89, t90, t91, t94, t103, t13...857
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 127 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 126 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 126 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 125 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 125 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 124 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 124 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 123 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 123 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 122 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 122 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 121 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 121 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 120 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 120 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 119 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 119 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 118 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 118 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 117 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 117 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 115 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 114 transition count 306
Applied a total of 37 rules in 24 ms. Remains 114 /131 variables (removed 17) and now considering 306/347 (removed 41) transitions.
[2026-05-26 15:22:24] [INFO ] Flow matrix only has 280 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-11649463420695030183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10729443152569478352.kers'
[2026-05-26 15:22:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11649463420695030183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10729443152569478352.kers]
Normalized transition count is 279 out of 280 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 114 cols 951 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 15:22:24] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10729443152569478352.kers
Total runtime 2 ms.
[2026-05-26 15:22:24] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-26 15:22:24] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 15:22:24] [INFO ] Invariant cache hit.
[2026-05-26 15:22:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:22:25] [INFO ] Implicit Places using invariants and state equation in 299 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 434 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 112/131 places, 306/347 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 464 ms. Remains : 112/131 places, 306/347 transitions.
[2026-05-26 15:22:25] [INFO ] Flatten gal took : 6 ms
[2026-05-26 15:22:25] [INFO ] Flatten gal took : 6 ms
[2026-05-26 15:22:25] [INFO ] Input system was already deterministic with 306 transitions.
[2026-05-26 15:22:25] [INFO ] Flatten gal took : 10 ms
[2026-05-26 15:22:25] [INFO ] Flatten gal took : 10 ms
[2026-05-26 15:22:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6410387696913015083.gal : 3 ms
[2026-05-26 15:22:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12681786940605391857.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6410387696913015083.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12681786940605391857.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (2214 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality12681786940605391857.prop.
BEST_FIRST walk for 40004 steps (510 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1608 steps, run visited all 1 properties in 11 ms. (steps per millisecond=146 )
Probabilistic random walk after 1608 steps, saw 985 distinct states, run finished after 11 ms. (steps per millisecond=146 ) properties seen :1
FORMULA FireWire-PT-10-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 127 transition count 336
Applied a total of 11 rules in 4 ms. Remains 127 /131 variables (removed 4) and now considering 336/347 (removed 11) transitions.
[2026-05-26 15:22:25] [INFO ] Flow matrix only has 310 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-16694257292961001256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12056272621837377692.kers'
[2026-05-26 15:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16694257292961001256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12056272621837377692.kers]
Normalized transition count is 309 out of 310 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 127 cols 1059 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-26 15:22:25] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12056272621837377692.kers
Total runtime 4 ms.
[2026-05-26 15:22:25] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-26 15:22:25] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2026-05-26 15:22:25] [INFO ] Invariant cache hit.
[2026-05-26 15:22:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 15:22:25] [INFO ] Implicit Places using invariants and state equation in 381 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 514 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/131 places, 336/347 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 336/336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 519 ms. Remains : 126/131 places, 336/347 transitions.
[2026-05-26 15:22:25] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:22:25] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:22:25] [INFO ] Input system was already deterministic with 336 transitions.
[2026-05-26 15:22:25] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:22:25] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:22:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11393177556517832816.gal : 5 ms
[2026-05-26 15:22:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5344519258637481596.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11393177556517832816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5344519258637481596.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,3.42591,70628,2,2981,5,211736,6,0,839,220675,0
Converting to forward existential form...Done !
original formula: E(EG(((!(EG(((p4==1)&&(p94==1)))) + ((p39==1)&&(p51==1))) + ((p9==1)&&(p45==1)))) U ((p8==1) * (A((((p5==1)&&(p37==1))||((p6==1)&&(p33==1...211
=> equivalent forward existential formula: ([(((FwdU(Init,EG(((!(EG(((p4==1)&&(p94==1)))) + ((p39==1)&&(p51==1))) + ((p9==1)&&(p45==1))))) * (p8==1)) * !(E...447
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...712
Detected timeout of ITS tools.
[2026-05-26 15:22:56] [INFO ] Flatten gal took : 14 ms
[2026-05-26 15:22:56] [INFO ] Applying decomposition
[2026-05-26 15:22:56] [INFO ] Flatten gal took : 14 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/graph3881304920880885084.txt' '-o' '/tmp/graph3881304920880885084.bin' '-w' '/tmp/graph3881304920880885084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3881304920880885084.bin' '-l' '-1' '-v' '-w' '/tmp/graph3881304920880885084.weights' '-q' '0' '-e' '0.001'
[2026-05-26 15:22:56] [INFO ] Decomposing Gal with order
[2026-05-26 15:22:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:22:56] [INFO ] Removed a total of 524 redundant transitions.
[2026-05-26 15:22:56] [INFO ] Flatten gal took : 33 ms
[2026-05-26 15:22:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 20 ms.
[2026-05-26 15:22:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16102424250842846255.gal : 6 ms
[2026-05-26 15:22:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16974800169088363973.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16102424250842846255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16974800169088363973.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,21.272,337316,2768,244,443240,4400,693,1.63556e+06,96,37869,0
Converting to forward existential form...Done !
original formula: E(EG(((!(EG(((i1.i2.u1.p4==1)&&(i1.i2.u31.p94==1)))) + ((i3.i1.u13.p39==1)&&(i3.i1.u14.p51==1))) + ((i3.i0.u3.p9==1)&&(i4.u21.p45==1)))) ...340
=> equivalent forward existential formula: ([(((FwdU(Init,EG(((!(EG(((i1.i2.u1.p4==1)&&(i1.i2.u31.p94==1)))) + ((i3.i1.u13.p39==1)&&(i3.i1.u14.p51==1))) + ...677
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t65, t66, t71, t76, t84, t88, t89, t90, t91, t94,...889
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 127 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 126 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 126 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 125 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 125 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 124 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 124 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 123 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 123 transition count 326
Applied a total of 19 rules in 9 ms. Remains 123 /131 variables (removed 8) and now considering 326/347 (removed 21) transitions.
[2026-05-26 15:23:26] [INFO ] Flow matrix only has 300 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-4072213137648932590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-434700672956027759.kers'
[2026-05-26 15:23:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4072213137648932590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-434700672956027759.kers]
Normalized transition count is 299 out of 300 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 123 cols 1023 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-26 15:23:26] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-434700672956027759.kers
Total runtime 2 ms.
[2026-05-26 15:23:26] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-26 15:23:26] [INFO ] Flow matrix only has 300 transitions (discarded 26 similar events)
[2026-05-26 15:23:26] [INFO ] Invariant cache hit.
[2026-05-26 15:23:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:23:26] [INFO ] Implicit Places using invariants and state equation in 291 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 432 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/131 places, 326/347 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 444 ms. Remains : 121/131 places, 326/347 transitions.
[2026-05-26 15:23:26] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:23:26] [INFO ] Flatten gal took : 6 ms
[2026-05-26 15:23:26] [INFO ] Input system was already deterministic with 326 transitions.
[2026-05-26 15:23:26] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:23:26] [INFO ] Flatten gal took : 7 ms
[2026-05-26 15:23:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2022131558643415797.gal : 2 ms
[2026-05-26 15:23:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9038072078308845017.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2022131558643415797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9038072078308845017.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17395e+07,2.25023,45952,2,2942,5,117498,6,0,809,125111,0
Converting to forward existential form...Done !
original formula: EX(((p3==1)&&(p121==1)))
=> equivalent forward existential formula: [(EY(Init) * ((p3==1)&&(p121==1)))] != FALSE
(forward)formula 0,0,2.26491,46044,1,0,8,117498,8,1,1181,125111,2
FORMULA FireWire-PT-10-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 15:23:28] [INFO ] Flatten gal took : 8 ms
[2026-05-26 15:23:29] [INFO ] Flatten gal took : 8 ms
[2026-05-26 15:23:29] [INFO ] Applying decomposition
[2026-05-26 15:23:29] [INFO ] Flatten gal took : 7 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/graph11371993388039226519.txt' '-o' '/tmp/graph11371993388039226519.bin' '-w' '/tmp/graph11371993388039226519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11371993388039226519.bin' '-l' '-1' '-v' '-w' '/tmp/graph11371993388039226519.weights' '-q' '0' '-e' '0.001'
[2026-05-26 15:23:29] [INFO ] Decomposing Gal with order
[2026-05-26 15:23:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:23:29] [INFO ] Removed a total of 540 redundant transitions.
[2026-05-26 15:23:29] [INFO ] Flatten gal took : 22 ms
[2026-05-26 15:23:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 7 ms.
[2026-05-26 15:23:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5232406573125713575.gal : 3 ms
[2026-05-26 15:23:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9725523134231028296.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5232406573125713575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9725523134231028296.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26692e+07,30.687,430076,2781,237,484508,3650,705,2.35548e+06,108,40344,0
Converting to forward existential form...Done !
original formula: E((!((!(EF((((i3.i1.u13.p40==1)&&(i4.u18.p53==1))&&((i5.u2.p8==1)&&(i5.u43.p107==1))))) + (AF((((i1.i0.u1.p5==1)&&(i1.i0.u5.p26==1))||(i2...669
=> equivalent forward existential formula: [((FwdU(Init,(!((!(E(TRUE U (((i3.i1.u13.p40==1)&&(i4.u18.p53==1))&&((i5.u2.p8==1)&&(i5.u43.p107==1))))) + (!(EG...949
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t46, t47, t55, t57, t62, t67, t72, t77, t89, t90, t91, t92, t104, t140, t142, ...824
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,149.086,2014668,1,0,2.43742e+06,12954,3815,9.84847e+06,512,99232,5577591
FORMULA FireWire-PT-10-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (AX(AF(!(E(((i5.u2.p8==1)&&(i2.u12.p38==1)) U ((i3.i0.u3.p11==1)&&(i1.i1.u23.p76==1)))))) * ((AF(AG(((i5.u2.p8==0)||(i5.u43.p130==0)))) +...434
=> equivalent forward existential formula: ([FwdG(EY(Init),!(!(E(((i5.u2.p8==1)&&(i2.u12.p38==1)) U ((i3.i0.u3.p11==1)&&(i1.i1.u23.p76==1))))))] = FALSE * ...1864
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 1,0,238.469,2204624,1,0,2.66789e+06,13161,2970,1.05142e+07,347,102427,3781946
FORMULA FireWire-PT-10-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EF((AG(EX(((i5.u2.p8==0)||(i4.u19.p64==0)))) + E(AX(((i4.u18.p6==1)&&(i5.u34.p103==1))) U EF(((i0.u0.p3==1)&&(i4.u19.p45==1)))))) + AF(A...246
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (!(E(TRUE U !(EX(((i5.u2.p8==0)||(i4.u19.p64==0)))))) + E(!(EX(!(((i4.u18.p6==1)&&(i5.u...360
(forward)formula 2,1,265.431,2204624,1,0,2.66789e+06,13670,3005,1.05142e+07,350,106853,5085230
FORMULA FireWire-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
ITS-tools command line returned an error code 139
[2026-05-26 15:29:12] [INFO ] Applying decomposition
[2026-05-26 15:29:12] [INFO ] Flatten gal took : 14 ms
[2026-05-26 15:29:12] [INFO ] Decomposing Gal with order
[2026-05-26 15:29:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:29:12] [INFO ] Removed a total of 436 redundant transitions.
[2026-05-26 15:29:12] [INFO ] Flatten gal took : 52 ms
[2026-05-26 15:29:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 7 ms.
[2026-05-26 15:29:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4271273721953800079.gal : 3 ms
[2026-05-26 15:29:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9124064700215758557.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4271273721953800079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9124064700215758557.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26692e+07,0.785409,22132,393,1336,11574,18679,163,28544,380,162323,0
Converting to forward existential form...Done !
original formula: (EG(((((E(!(((u1.p7==1)&&(u9.p115==1))) U ((u1.p4==1)&&(u3.p25==1))) * EF(((u1.p8==1)&&(u5.p58==1)))) + ((EG(((u1.p10==0)||(u9.p94==0))) ...814
=> equivalent forward existential formula: [(((Init * EG(((((E(!(((u1.p7==1)&&(u9.p115==1))) U ((u1.p4==1)&&(u3.p25==1))) * E(TRUE U ((u1.p8==1)&&(u5.p58==...2345
Reverse transition relation is NOT exact ! Due to transitions t82, t94, t95, t103, t180, t232, t233, t243, t250, t260, t261, t295, t314, t322, t324, t328, ...491
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,25.3814,625864,1,0,938953,240732,1088,1.57558e+06,1697,1.58645e+06,1567014
FORMULA FireWire-PT-10-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(EG(((!(EG(((u1.p4==1)&&(u9.p94==1)))) + ((u4.p39==1)&&(u5.p51==1))) + ((u1.p9==1)&&(u5.p45==1)))) U ((u1.p8==1) * (A((((u1.p5==1)&&(u3....256
=> equivalent forward existential formula: ([(((FwdU(Init,EG(((!(EG(((u1.p4==1)&&(u9.p94==1)))) + ((u4.p39==1)&&(u5.p51==1))) + ((u1.p9==1)&&(u5.p45==1))))...525
(forward)formula 1,1,29.0651,692664,1,0,1.02479e+06,257539,1263,1.73675e+06,1745,1.76994e+06,1727647
FORMULA FireWire-PT-10-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 1009369 ms.
BK_STOP 1779809381864
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-10"
export BK_EXAMINATION="CTLFireability"
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-10, examination is CTLFireability"
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-177955809000218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;