About the Execution of ITS-Tools for FireWire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3199.516 | 1073376.00 | 1167733.00 | 3187.10 | TFTTTTTFTTTFTTTT | 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-177955809000210.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-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000210
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 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 100K 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-09-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779806070244
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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 14:34:32] [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 14:34:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 14:34:32] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2026-05-26 14:34:32] [INFO ] Transformed 130 places.
[2026-05-26 14:34:32] [INFO ] Transformed 408 transitions.
[2026-05-26 14:34:32] [INFO ] Found NUPN structural information;
[2026-05-26 14:34:32] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 77 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 352/352 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 129 transition count 350
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 129 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 129 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 129 transition count 343
Applied a total of 9 rules in 55 ms. Remains 129 /130 variables (removed 1) and now considering 343/352 (removed 9) transitions.
[2026-05-26 14:34:32] [INFO ] Flow matrix only has 317 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-17701915521563521903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12533279005243917436.kers'
[2026-05-26 14:34:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17701915521563521903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12533279005243917436.kers]
Normalized transition count is 316 out of 317 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 129 cols 1085 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-26 14:34:32] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12533279005243917436.kers
Total runtime 4 ms.
[2026-05-26 14:34:33] [INFO ] Implicit Places using invariants in 405 ms returned []
[2026-05-26 14:34:33] [INFO ] Flow matrix only has 317 transitions (discarded 26 similar events)
[2026-05-26 14:34:33] [INFO ] Invariant cache hit.
[2026-05-26 14:34:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:34:33] [INFO ] Implicit Places using invariants and state equation in 394 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 854 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/130 places, 343/352 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 954 ms. Remains : 128/130 places, 343/352 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2026-05-26 14:34:33] [INFO ] Flow matrix only has 317 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-8278396790190470434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10081169755664330085.kers'
[2026-05-26 14:34:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8278396790190470434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10081169755664330085.kers]
Normalized transition count is 316 out of 317 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 128 cols 1081 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-26 14:34:33] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10081169755664330085.kers
Total runtime 3 ms.
[2026-05-26 14:34:33] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-26 14:34:33] [INFO ] Flow matrix only has 317 transitions (discarded 26 similar events)
[2026-05-26 14:34:33] [INFO ] Invariant cache hit.
[2026-05-26 14:34:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:34:34] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2026-05-26 14:34:34] [INFO ] Flow matrix only has 317 transitions (discarded 26 similar events)
[2026-05-26 14:34:34] [INFO ] Invariant cache hit.
[2026-05-26 14:34:34] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (OVERLAPS) 316/444 variables, 128/141 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 44/185 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 1/445 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 9 (OVERLAPS) 0/445 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 186 constraints, problems are : Problem set: 0 solved, 342 unsolved in 29508 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (OVERLAPS) 316/444 variables, 128/141 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 44/185 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 342/527 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/445 variables, and 530 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59981ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 60006ms
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 128/128 places, 343/343 transitions.
Support contains 77 out of 128 places after structural reductions.
[2026-05-26 14:35:34] [INFO ] Flatten gal took : 111 ms
[2026-05-26 14:35:34] [INFO ] Flatten gal took : 48 ms
[2026-05-26 14:35:34] [INFO ] Input system was already deterministic with 343 transitions.
Support contains 75 out of 128 places (down from 77) after GAL structural reductions.
RANDOM walk for 40000 steps (2230 resets) in 3113 ms. (12 steps per ms) remains 49/80 properties
BEST_FIRST walk for 4004 steps (64 resets) in 42 ms. (93 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (62 resets) in 39 ms. (100 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (58 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (63 resets) in 60 ms. (65 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 45/49 properties
BEST_FIRST walk for 4003 steps (103 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (58 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (50 resets) in 53 ms. (74 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (14 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (150 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 41/44 properties
BEST_FIRST walk for 4003 steps (57 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (20 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (65 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (54 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (18 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (66 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (11 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (71 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (53 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (21 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (70 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (57 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (103 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (57 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (100 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (62 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (58 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (109 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (61 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
[2026-05-26 14:35:36] [INFO ] Flow matrix only has 317 transitions (discarded 26 similar events)
[2026-05-26 14:35:36] [INFO ] Invariant cache hit.
[2026-05-26 14:35:36] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/120 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 3/9 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 5/125 variables, 1/10 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 316/441 variables, 125/135 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 44/179 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 0/179 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 3/444 variables, 3/182 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 2/184 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/184 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 1/445 variables, 1/185 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/185 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/445 variables, 0/185 constraints. Problems are: Problem set: 5 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 185 constraints, problems are : Problem set: 5 solved, 35 unsolved in 4869 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 35 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/120 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 5/125 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/13 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 316/441 variables, 125/138 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 44/182 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 32/214 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 1/215 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/216 constraints. Problems are: Problem set: 7 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/445 variables, and 216 constraints, problems are : Problem set: 7 solved, 33 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/128 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 32/40 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9928ms problems are : Problem set: 7 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 343/343 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 128 transition count 340
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 5 place count 127 transition count 339
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 124 transition count 345
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 124 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 124 transition count 336
Applied a total of 20 rules in 123 ms. Remains 124 /128 variables (removed 4) and now considering 336/343 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 124/128 places, 336/343 transitions.
RANDOM walk for 40000 steps (2190 resets) in 1054 ms. (37 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (51 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (66 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (94 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (49 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (50 resets) in 63 ms. (62 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (52 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (21 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (67 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (48 resets) in 22 ms. (174 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (66 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (46 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (56 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (9 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (68 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (53 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (108 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (65 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (113 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (109 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (69 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 408067 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :25 out of 30
Probabilistic random walk after 408067 steps, saw 93658 distinct states, run finished after 3009 ms. (steps per millisecond=135 ) properties seen :25
[2026-05-26 14:35:49] [INFO ] Flow matrix only has 308 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-6368629902557900681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13284244899644213902.kers'
[2026-05-26 14:35:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6368629902557900681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13284244899644213902.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 124 cols 1059 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-26 14:35:49] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13284244899644213902.kers
Total runtime 2 ms.
[2026-05-26 14:35:49] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 55/121 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 308/429 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/432 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/432 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 181 constraints, problems are : Problem set: 0 solved, 5 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 55/121 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 308/429 variables, 121/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 46/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/432 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/432 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 188 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2190ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1489 ms.
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 336/336 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 332
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 332
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 122 transition count 330
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 122 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 121 transition count 329
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 120 transition count 328
Applied a total of 9 rules in 58 ms. Remains 120 /124 variables (removed 4) and now considering 328/336 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 120/124 places, 328/336 transitions.
RANDOM walk for 40000 steps (2306 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (585 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (553 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (70 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (563 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (533 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 602513 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 5
Probabilistic random walk after 602513 steps, saw 127076 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2026-05-26 14:35:56] [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-7512201703227053230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6716960602610648845.kers'
[2026-05-26 14:35:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7512201703227053230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6716960602610648845.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 300 rows 119 cols 1022 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-26 14:35:56] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6716960602610648845.kers
Total runtime 1 ms.
[2026-05-26 14:35:56] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 250/315 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 100/415 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 22/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/416 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/420 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/420 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 172 constraints, problems are : Problem set: 0 solved, 5 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 250/315 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 100/415 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 22/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/416 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 4/420 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/420 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 178 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1934ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1229 ms.
Support contains 7 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 328/328 transitions.
Applied a total of 0 rules in 12 ms. Remains 120 /120 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 120/120 places, 328/328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 328/328 transitions.
Applied a total of 0 rules in 11 ms. Remains 120 /120 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2026-05-26 14:35:59] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
[2026-05-26 14:35:59] [INFO ] Invariant cache hit.
[2026-05-26 14:36:00] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-26 14:36:00] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
[2026-05-26 14:36:00] [INFO ] Invariant cache hit.
[2026-05-26 14:36:00] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:36:00] [INFO ] Implicit Places using invariants and state equation in 290 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 434 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/120 places, 328/328 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 327
Applied a total of 2 rules in 20 ms. Remains 118 /119 variables (removed 1) and now considering 327/328 (removed 1) transitions.
[2026-05-26 14:36:00] [INFO ] Flow matrix only has 299 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-1070729106465745429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3687430921958855501.kers'
[2026-05-26 14:36:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1070729106465745429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3687430921958855501.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 118 cols 1021 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-26 14:36:00] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3687430921958855501.kers
Total runtime 1 ms.
[2026-05-26 14:36:00] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-26 14:36:00] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
[2026-05-26 14:36:00] [INFO ] Invariant cache hit.
[2026-05-26 14:36:00] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:36:00] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 118/120 places, 327/328 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 956 ms. Remains : 118/120 places, 327/328 transitions.
RANDOM walk for 40000 steps (2298 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (561 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (510 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (66 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (563 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (561 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 520241 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 5
Probabilistic random walk after 520241 steps, saw 109393 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2026-05-26 14:36:04] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
[2026-05-26 14:36:04] [INFO ] Invariant cache hit.
[2026-05-26 14:36:04] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 250/315 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 99/414 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 22/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/415 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/417 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/417 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 169 constraints, problems are : Problem set: 0 solved, 5 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 250/315 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 99/414 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 22/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/415 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/417 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/417 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 175 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2113 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2825ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3855 ms.
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 327/327 transitions.
Applied a total of 0 rules in 10 ms. Remains 118 /118 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 118/118 places, 327/327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 327/327 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2026-05-26 14:36:10] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
[2026-05-26 14:36:10] [INFO ] Invariant cache hit.
[2026-05-26 14:36:10] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-26 14:36:10] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
[2026-05-26 14:36:10] [INFO ] Invariant cache hit.
[2026-05-26 14:36:10] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:36:11] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2026-05-26 14:36:11] [INFO ] Redundant transitions in 40 ms returned []
Running 325 sub problems to find dead transitions.
[2026-05-26 14:36:11] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
[2026-05-26 14:36:11] [INFO ] Invariant cache hit.
[2026-05-26 14:36:11] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 299/416 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 178 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 299/416 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 325/502 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/417 variables, and 505 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60827 ms. Remains : 118/118 places, 327/327 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 118 vertex of which 31 / 118 are part of one of the 5 SCC in 2 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 122 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 129 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 91 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 90 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 90 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 89 transition count 192
Free-agglomeration rule applied 2 times with reduction of 1 identical transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 89 transition count 189
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 87 transition count 188
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 87 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 87 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 86 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 86 transition count 186
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 86 transition count 186
Applied a total of 20 rules in 49 ms. Remains 86 /118 variables (removed 32) and now considering 186/327 (removed 141) transitions.
Running SMT prover for 5 properties.
[2026-05-26 14:37:11] [INFO ] Flow matrix only has 184 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-170828313356819699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12190652245103836677.kers'
[2026-05-26 14:37:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-170828313356819699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12190652245103836677.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 86 cols 679 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-26 14:37:11] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12190652245103836677.kers
Total runtime 1 ms.
[2026-05-26 14:37:11] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-26 14:37:11] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2026-05-26 14:37:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-26 14:37:11] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2026-05-26 14:37:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2026-05-26 14:37:12] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2026-05-26 14:37:12] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 707 ms.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-09-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 14:37:12] [INFO ] Flatten gal took : 29 ms
[2026-05-26 14:37:12] [INFO ] Flatten gal took : 32 ms
[2026-05-26 14:37:12] [INFO ] Input system was already deterministic with 343 transitions.
Computed a total of 22 stabilizing places and 47 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 336
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 336
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 124 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 305
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 34 place count 111 transition count 304
Applied a total of 34 rules in 55 ms. Remains 111 /128 variables (removed 17) and now considering 304/343 (removed 39) transitions.
[2026-05-26 14:37:12] [INFO ] Flow matrix only has 278 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-3218165972922283054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5323127327917653801.kers'
[2026-05-26 14:37:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3218165972922283054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5323127327917653801.kers]
Normalized transition count is 277 out of 278 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 277 rows 110 cols 931 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-26 14:37:12] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5323127327917653801.kers
Total runtime 2 ms.
[2026-05-26 14:37:12] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-26 14:37:12] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 14:37:12] [INFO ] Invariant cache hit.
[2026-05-26 14:37:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:37:13] [INFO ] Implicit Places using invariants and state equation in 435 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 539 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/128 places, 304/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 110 /110 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 604 ms. Remains : 110/128 places, 304/343 transitions.
[2026-05-26 14:37:13] [INFO ] Flatten gal took : 21 ms
[2026-05-26 14:37:13] [INFO ] Flatten gal took : 21 ms
[2026-05-26 14:37:13] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-26 14:37:13] [INFO ] Flatten gal took : 57 ms
RANDOM walk for 40000 steps (2313 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (554 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2376 steps, run visited all 1 properties in 10 ms. (steps per millisecond=237 )
Probabilistic random walk after 2376 steps, saw 1420 distinct states, run finished after 15 ms. (steps per millisecond=158 ) properties seen :1
FORMULA FireWire-PT-09-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-05-26 14:37:13] [INFO ] Flatten gal took : 36 ms
[2026-05-26 14:37:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17630107024646793114.gal : 10 ms
[2026-05-26 14:37:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12233689829638848393.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/ReachabilityCardinality17630107024646793114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12233689829638848393.prop' '--nowitness' '--gen-order' 'FOLLOW'
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 ...330
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 337
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 125 transition count 335
Applied a total of 8 rules in 4 ms. Remains 125 /128 variables (removed 3) and now considering 335/343 (removed 8) transitions.
[2026-05-26 14:37:13] [INFO ] Flow matrix only has 309 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-8603459001964364426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10136721153901950722.kers'
[2026-05-26 14:37:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8603459001964364426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10136721153901950722.kers]
Normalized transition count is 308 out of 309 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 125 cols 1052 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-26 14:37:13] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10136721153901950722.kers
Total runtime 2 ms.
[2026-05-26 14:37:13] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-26 14:37:13] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2026-05-26 14:37:13] [INFO ] Invariant cache hit.
[2026-05-26 14:37:13] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:37:13] [INFO ] Implicit Places using invariants and state equation in 366 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 499 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 335/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 505 ms. Remains : 124/128 places, 335/343 transitions.
[2026-05-26 14:37:13] [INFO ] Flatten gal took : 27 ms
[2026-05-26 14:37:13] [INFO ] Flatten gal took : 28 ms
[2026-05-26 14:37:13] [INFO ] Input system was already deterministic with 335 transitions.
[2026-05-26 14:37:14] [INFO ] Flatten gal took : 27 ms
[2026-05-26 14:37:14] [INFO ] Flatten gal took : 25 ms
[2026-05-26 14:37:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7456107707115249300.gal : 7 ms
[2026-05-26 14:37:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13049821710240886834.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7456107707115249300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13049821710240886834.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,6.46653e+06,10.4846,240928,2,10190,5,607769,6,0,830,761905,0
Converting to forward existential form...Done !
original formula: (EG(EX(((p3==0)||(p78==0)))) * EG(EF(((p9==1)&&(p45==1)))))
=> equivalent forward existential formula: [FwdG((Init * EG(EX(((p3==0)||(p78==0))))),E(TRUE U ((p9==1)&&(p45==1))))] != 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...705
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-26 14:37:44] [INFO ] Flatten gal took : 16 ms
[2026-05-26 14:37:44] [INFO ] Applying decomposition
[2026-05-26 14:37:44] [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/graph1738827641053656405.txt' '-o' '/tmp/graph1738827641053656405.bin' '-w' '/tmp/graph1738827641053656405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1738827641053656405.bin' '-l' '-1' '-v' '-w' '/tmp/graph1738827641053656405.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:37:44] [INFO ] Decomposing Gal with order
[2026-05-26 14:37:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:37:44] [INFO ] Removed a total of 523 redundant transitions.
[2026-05-26 14:37:44] [INFO ] Flatten gal took : 111 ms
[2026-05-26 14:37:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 23 ms.
[2026-05-26 14:37:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11277311236404239942.gal : 9 ms
[2026-05-26 14:37:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4694222358633764649.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/CTLFireability11277311236404239942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4694222358633764649.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,6.46653e+06,2.72368,75552,1946,179,122437,1897,649,322668,95,12281,0
Converting to forward existential form...Done !
original formula: (EG(EX(((i5.u0.p3==0)||(i5.u0.p78==0)))) * EG(EF(((i0.u3.p9==1)&&(i3.u21.p45==1)))))
=> equivalent forward existential formula: [FwdG((Init * EG(EX(((i5.u0.p3==0)||(i5.u0.p78==0))))),E(TRUE U ((i0.u3.p9==1)&&(i3.u21.p45==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t91, t94, t96, t133, t134, t135, t...870
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 337
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 125 transition count 335
Applied a total of 8 rules in 5 ms. Remains 125 /128 variables (removed 3) and now considering 335/343 (removed 8) transitions.
[2026-05-26 14:38:14] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2026-05-26 14:38:14] [INFO ] Invariant cache hit.
[2026-05-26 14:38:14] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-26 14:38:14] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2026-05-26 14:38:14] [INFO ] Invariant cache hit.
[2026-05-26 14:38:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:38:15] [INFO ] Implicit Places using invariants and state equation in 476 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 646 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 335/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 653 ms. Remains : 124/128 places, 335/343 transitions.
[2026-05-26 14:38:15] [INFO ] Flatten gal took : 18 ms
[2026-05-26 14:38:15] [INFO ] Flatten gal took : 19 ms
[2026-05-26 14:38:15] [INFO ] Input system was already deterministic with 335 transitions.
[2026-05-26 14:38:15] [INFO ] Flatten gal took : 20 ms
[2026-05-26 14:38:15] [INFO ] Flatten gal took : 18 ms
[2026-05-26 14:38:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9683948062946464504.gal : 5 ms
[2026-05-26 14:38:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2896716217856078310.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/CTLFireability9683948062946464504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2896716217856078310.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,6.46653e+06,10.8836,240872,2,10190,5,607769,6,0,830,761905,0
Converting to forward existential form...Done !
original formula: AX(AF(AG(((!(A(((p3==1)&&(p78==1)) U ((p3==1)&&(p60==1)))) + (p10==0)) + ((p119==0)||(p53==0))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(((!(!((E(!(((p3==1)&&(p60==1))) U (!(((p3==1)&&(p78==1))) * !(((p3==1)&&(p60==1)))...240
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 14:38:45] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:38:45] [INFO ] Applying decomposition
[2026-05-26 14:38:45] [INFO ] Flatten gal took : 11 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/graph1263509440786893656.txt' '-o' '/tmp/graph1263509440786893656.bin' '-w' '/tmp/graph1263509440786893656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1263509440786893656.bin' '-l' '-1' '-v' '-w' '/tmp/graph1263509440786893656.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:38:45] [INFO ] Decomposing Gal with order
[2026-05-26 14:38:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:38:45] [INFO ] Removed a total of 536 redundant transitions.
[2026-05-26 14:38:45] [INFO ] Flatten gal took : 41 ms
[2026-05-26 14:38:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 20 ms.
[2026-05-26 14:38:45] [INFO ] Time to serialize gal into /tmp/CTLFireability5678401860540329830.gal : 6 ms
[2026-05-26 14:38:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10757532586337519688.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/CTLFireability5678401860540329830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10757532586337519688.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,6.46653e+06,5.03716,112352,2325,174,153693,2018,652,574883,86,15069,0
Converting to forward existential form...Done !
original formula: AX(AF(AG(((!(A(((i0.u0.p3==1)&&(i0.u1.p78==1)) U ((i0.u0.p3==1)&&(i4.u22.p60==1)))) + (i1.u4.p10==0)) + ((i0.u41.p119==0)||(i4.u19.p53==0...161
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(((!(!((E(!(((i0.u0.p3==1)&&(i4.u22.p60==1))) U (!(((i0.u0.p3==1)&&(i0.u1.p78==1)))...311
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t88, t89, t90, t91, t94, t96, t137...852
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 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,21.9032,338628,1,0,445857,4333,3313,1.51638e+06,367,29319,1248939
FORMULA FireWire-PT-09-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 337
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 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 113 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 34 place count 112 transition count 305
Applied a total of 34 rules in 73 ms. Remains 112 /128 variables (removed 16) and now considering 305/343 (removed 38) transitions.
[2026-05-26 14:39:07] [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-13290153242136454597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-309126035535163067.kers'
[2026-05-26 14:39:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13290153242136454597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-309126035535163067.kers]
Normalized transition count is 278 out of 279 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 278 rows 112 cols 944 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-26 14:39:07] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-309126035535163067.kers
Total runtime 2 ms.
[2026-05-26 14:39:07] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-26 14:39:07] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2026-05-26 14:39:07] [INFO ] Invariant cache hit.
[2026-05-26 14:39:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:39:08] [INFO ] Implicit Places using invariants and state equation in 297 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 448 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/128 places, 305/343 transitions.
Applied a total of 0 rules in 12 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 533 ms. Remains : 111/128 places, 305/343 transitions.
[2026-05-26 14:39:08] [INFO ] Flatten gal took : 15 ms
[2026-05-26 14:39:08] [INFO ] Flatten gal took : 18 ms
[2026-05-26 14:39:08] [INFO ] Input system was already deterministic with 305 transitions.
[2026-05-26 14:39:08] [INFO ] Flatten gal took : 18 ms
[2026-05-26 14:39:08] [INFO ] Flatten gal took : 22 ms
[2026-05-26 14:39:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5936359431868313825.gal : 2 ms
[2026-05-26 14:39:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8636360635672899671.prop : 5 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/ReachabilityCardinality5936359431868313825.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8636360635672899671.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 (2234 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (625 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality8636360635672899671.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 23
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23 after 33
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33 after 58
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :58 after 406
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :406 after 786
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :786 after 6954
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6954 after 22409
Reachability property FireWire-PT-09-CTLFireability-2024-04 is true.
FORMULA FireWire-PT-09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,68047,1.88744,41832,2,4542,17,94841,6,0,749,122504,0
Total reachable state count : 68047
Verifying 1 reachability properties.
Reachability property FireWire-PT-09-CTLFireability-2024-04 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-09-CTLFireability-2024-04,13,1.90171,41832,2,156,17,94841,7,0,766,122504,0
Finished probabilistic random walk after 1163398 steps, run visited all 1 properties in 2693 ms. (steps per millisecond=432 )
Probabilistic random walk after 1163398 steps, saw 235130 distinct states, run finished after 2693 ms. (steps per millisecond=432 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 337
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 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 113 transition count 306
Applied a total of 32 rules in 13 ms. Remains 113 /128 variables (removed 15) and now considering 306/343 (removed 37) transitions.
[2026-05-26 14:39:11] [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-11341734934922544703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-983876803182977591.kers'
[2026-05-26 14:39:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11341734934922544703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-983876803182977591.kers]
Normalized transition count is 279 out of 280 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 113 cols 946 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 14:39:11] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-983876803182977591.kers
Total runtime 2 ms.
[2026-05-26 14:39:11] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-26 14:39:11] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:39:11] [INFO ] Invariant cache hit.
[2026-05-26 14:39:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:39:11] [INFO ] Implicit Places using invariants and state equation in 256 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 372 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/128 places, 306/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 387 ms. Remains : 112/128 places, 306/343 transitions.
[2026-05-26 14:39:11] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:39:11] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:39:11] [INFO ] Input system was already deterministic with 306 transitions.
[2026-05-26 14:39:11] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:39:11] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:39:11] [INFO ] Time to serialize gal into /tmp/CTLFireability118459848837364313.gal : 2 ms
[2026-05-26 14:39:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6898355700285167370.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/CTLFireability118459848837364313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6898355700285167370.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 -...282
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,6.34422e+06,10.4988,183948,2,6955,5,474104,6,0,753,635071,0
Converting to forward existential form...Done !
original formula: EF((AX(AG(!(A(((p8==1)&&(p101==1)) U (p31==1))))) * EX(EX(TRUE))))
=> equivalent forward existential formula: [(EY(EY((FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(!(!((E(!((p31==1)) U (!(((p8==1)&&(p101==1))) * !((p31==1)))) + E...199
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...633
Detected timeout of ITS tools.
[2026-05-26 14:39:41] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:39:41] [INFO ] Applying decomposition
[2026-05-26 14:39:41] [INFO ] Flatten gal took : 11 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/graph17026511125065867903.txt' '-o' '/tmp/graph17026511125065867903.bin' '-w' '/tmp/graph17026511125065867903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17026511125065867903.bin' '-l' '-1' '-v' '-w' '/tmp/graph17026511125065867903.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:39:41] [INFO ] Decomposing Gal with order
[2026-05-26 14:39:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:39:41] [INFO ] Removed a total of 479 redundant transitions.
[2026-05-26 14:39:41] [INFO ] Flatten gal took : 36 ms
[2026-05-26 14:39:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 16 ms.
[2026-05-26 14:39:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10720074850954813139.gal : 6 ms
[2026-05-26 14:39:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11820951531187434737.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/CTLFireability10720074850954813139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11820951531187434737.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,6.34422e+06,8.69467,169616,1830,164,302801,1491,592,531053,85,13074,0
Converting to forward existential form...Done !
original formula: EF((AX(AG(!(A(((i5.u2.p8==1)&&(i7.u34.p101==1)) U (i3.u11.p31==1))))) * EX(EX(TRUE))))
=> equivalent forward existential formula: [(EY(EY((FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(!(!((E(!((i3.u11.p31==1)) U (!(((i5.u2.p8==1)&&(i7.u34.p101==1)))...233
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t79, t88, t89, t90, t91, t96, t137...749
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 an SCC at level 2
Fast SCC detection found an SCC at level 3
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 7
(forward)formula 0,1,20.3172,295564,1,0,483658,4968,3095,1.00748e+06,368,33196,1261259
FORMULA FireWire-PT-09-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 126 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 125 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 118 transition count 318
Applied a total of 21 rules in 15 ms. Remains 118 /128 variables (removed 10) and now considering 318/343 (removed 25) transitions.
[2026-05-26 14:40:02] [INFO ] Flow matrix only has 292 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-12856095001118015559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5076230610589642765.kers'
[2026-05-26 14:40:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12856095001118015559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5076230610589642765.kers]
Normalized transition count is 291 out of 292 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 118 cols 991 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-26 14:40:02] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5076230610589642765.kers
Total runtime 2 ms.
[2026-05-26 14:40:02] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-26 14:40:02] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2026-05-26 14:40:02] [INFO ] Invariant cache hit.
[2026-05-26 14:40:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 14:40:02] [INFO ] Implicit Places using invariants and state equation in 300 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 417 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/128 places, 318/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 434 ms. Remains : 117/128 places, 318/343 transitions.
[2026-05-26 14:40:02] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:40:02] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:40:02] [INFO ] Input system was already deterministic with 318 transitions.
[2026-05-26 14:40:02] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:40:02] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:40:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13303588834069948347.gal : 4 ms
[2026-05-26 14:40:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2144960984310566080.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/CTLFireability13303588834069948347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2144960984310566080.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,6.5629e+06,11.2657,230296,2,9018,5,597606,6,0,785,767228,0
Converting to forward existential form...Done !
original formula: AF(E(EX((AX(((p6==1)&&(p112==1))) * !(EG(((p71==1)&&(p129==1)))))) U (EF(((p9==1)&&(p86==1))) * !(((E(((p11==1)&&(p52==1)) U ((p8==1)&&(p...210
=> equivalent forward existential formula: [FwdG(Init,!(E(EX((!(EX(!(((p6==1)&&(p112==1))))) * !(EG(((p71==1)&&(p129==1)))))) U (E(TRUE U ((p9==1)&&(p86==1...267
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...663
Detected timeout of ITS tools.
[2026-05-26 14:40:32] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:40:32] [INFO ] Applying decomposition
[2026-05-26 14:40:32] [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/graph2902073984473522326.txt' '-o' '/tmp/graph2902073984473522326.bin' '-w' '/tmp/graph2902073984473522326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2902073984473522326.bin' '-l' '-1' '-v' '-w' '/tmp/graph2902073984473522326.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:40:32] [INFO ] Decomposing Gal with order
[2026-05-26 14:40:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:40:32] [INFO ] Removed a total of 489 redundant transitions.
[2026-05-26 14:40:32] [INFO ] Flatten gal took : 31 ms
[2026-05-26 14:40:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 11 ms.
[2026-05-26 14:40:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12840805807121880542.gal : 3 ms
[2026-05-26 14:40:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9775570599396010642.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/CTLFireability12840805807121880542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9775570599396010642.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,6.5629e+06,3.54147,72992,1945,179,108058,1829,611,324076,106,10330,0
Converting to forward existential form...Done !
original formula: AF(E(EX((AX(((i6.i2.u36.p6==1)&&(i6.i2.u36.p112==1))) * !(EG(((i6.i0.u22.p71==1)&&(i6.i1.u34.p129==1)))))) U (EF(((i1.i0.u3.p9==1)&&(i0.u...316
=> equivalent forward existential formula: [FwdG(Init,!(E(EX((!(EX(!(((i6.i2.u36.p6==1)&&(i6.i2.u36.p112==1))))) * !(EG(((i6.i0.u22.p71==1)&&(i6.i1.u34.p12...373
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t79, t88, t89, t90, t91, t94, t96, t137...798
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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,7.19947,115300,1,0,179674,3437,3115,490817,481,14865,511567
FORMULA FireWire-PT-09-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 337
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 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 315
Applied a total of 24 rules in 10 ms. Remains 117 /128 variables (removed 11) and now considering 315/343 (removed 28) transitions.
[2026-05-26 14:40:40] [INFO ] Flow matrix only has 289 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-14557908999297698526.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9798564248238171180.kers'
[2026-05-26 14:40:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14557908999297698526.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9798564248238171180.kers]
Normalized transition count is 288 out of 289 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 117 cols 980 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-26 14:40:40] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9798564248238171180.kers
Total runtime 3 ms.
[2026-05-26 14:40:40] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-26 14:40:40] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2026-05-26 14:40:40] [INFO ] Invariant cache hit.
[2026-05-26 14:40:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 14:40:40] [INFO ] Implicit Places using invariants and state equation in 274 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 391 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/128 places, 315/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 315/315 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 116/128 places, 315/343 transitions.
[2026-05-26 14:40:40] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:40:40] [INFO ] Flatten gal took : 19 ms
[2026-05-26 14:40:40] [INFO ] Input system was already deterministic with 315 transitions.
[2026-05-26 14:40:40] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:40:40] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:40:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2612367131947862937.gal : 3 ms
[2026-05-26 14:40:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11250611548576041020.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/CTLFireability2612367131947862937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11250611548576041020.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,6.38442e+06,8.98921,198572,2,9059,5,526306,6,0,778,716564,0
Converting to forward existential form...Done !
original formula: (EX((AX(EG(((p3==1)&&(p124==1)))) + AX((EG(((p8==0)||(p103==0))) * AG(((p3==0)||(p94==0))))))) * EF(AG((((!(A(((p8==1)&&(p129==1)) U ((p7...222
=> equivalent forward existential formula: [(FwdU((Init * EX((!(EX(!(EG(((p3==1)&&(p124==1)))))) + !(EX(!((EG(((p8==0)||(p103==0))) * !(E(TRUE U !(((p3==0)...377
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...657
Detected timeout of ITS tools.
[2026-05-26 14:41:10] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:41:10] [INFO ] Applying decomposition
[2026-05-26 14:41:10] [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/graph14725229005810923248.txt' '-o' '/tmp/graph14725229005810923248.bin' '-w' '/tmp/graph14725229005810923248.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14725229005810923248.bin' '-l' '-1' '-v' '-w' '/tmp/graph14725229005810923248.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:41:10] [INFO ] Decomposing Gal with order
[2026-05-26 14:41:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:41:10] [INFO ] Removed a total of 496 redundant transitions.
[2026-05-26 14:41:10] [INFO ] Flatten gal took : 22 ms
[2026-05-26 14:41:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 10 ms.
[2026-05-26 14:41:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3783220664804271772.gal : 3 ms
[2026-05-26 14:41:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1809488054803400415.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/CTLFireability3783220664804271772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1809488054803400415.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.
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,6.38442e+06,15.9467,304016,2692,208,333406,3605,647,1.89893e+06,86,39668,0
Converting to forward existential form...Done !
original formula: (EX((AX(EG(((i0.u0.p3==1)&&(i0.u1.p124==1)))) + AX((EG(((i2.u3.p8==0)||(i5.i1.u36.p103==0))) * AG(((i0.u0.p3==0)||(i1.i2.u33.p94==0))))))...332
=> equivalent forward existential formula: [(FwdU((Init * EX((!(EX(!(EG(((i0.u0.p3==1)&&(i0.u1.p124==1)))))) + !(EX(!((EG(((i2.u3.p8==0)||(i5.i1.u36.p103==...513
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t55, t56, t61, t66, t71, t76, t88, t89, t90, t91, t94, t137...799
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 336
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 336
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 124 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 305
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 34 place count 111 transition count 304
Applied a total of 34 rules in 39 ms. Remains 111 /128 variables (removed 17) and now considering 304/343 (removed 39) transitions.
[2026-05-26 14:41:40] [INFO ] Flow matrix only has 278 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-18122719957827162917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16620490375175997474.kers'
[2026-05-26 14:41:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18122719957827162917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16620490375175997474.kers]
Normalized transition count is 277 out of 278 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 277 rows 110 cols 931 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-26 14:41:40] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16620490375175997474.kers
Total runtime 2 ms.
[2026-05-26 14:41:41] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-26 14:41:41] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 14:41:41] [INFO ] Invariant cache hit.
[2026-05-26 14:41:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:41:41] [INFO ] Implicit Places using invariants and state equation in 319 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 486 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/128 places, 304/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 110 /110 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 535 ms. Remains : 110/128 places, 304/343 transitions.
[2026-05-26 14:41:41] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:41:41] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:41:41] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-26 14:41:41] [INFO ] Flatten gal took : 15 ms
[2026-05-26 14:41:41] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:41:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11051049568795913481.gal : 3 ms
[2026-05-26 14:41:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9130646743150654723.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/CTLFireability11051049568795913481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9130646743150654723.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,5.27902e+06,4.88894,117852,2,5768,5,307969,6,0,743,397076,0
Converting to forward existential form...Done !
original formula: (EF(((A(((p8==1)&&(p37==1)) U (p100==1)) * (p7==1)) * (p32==1))) * EG((AF(!(A((p36==1) U ((p9==1)&&(p47==1))))) * ((p8==0)||(p63==0)))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((!((E(!((p100==1)) U (!(((p8==1)&&(p37==1))) * !((p100==1)))) + EG(!((p100==1))))) * (p7...323
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...627
Detected timeout of ITS tools.
[2026-05-26 14:42:11] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:42:11] [INFO ] Applying decomposition
[2026-05-26 14:42:11] [INFO ] Flatten gal took : 6 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/graph13356032029505848991.txt' '-o' '/tmp/graph13356032029505848991.bin' '-w' '/tmp/graph13356032029505848991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13356032029505848991.bin' '-l' '-1' '-v' '-w' '/tmp/graph13356032029505848991.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:42:11] [INFO ] Decomposing Gal with order
[2026-05-26 14:42:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:42:11] [INFO ] Removed a total of 474 redundant transitions.
[2026-05-26 14:42:11] [INFO ] Flatten gal took : 28 ms
[2026-05-26 14:42:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 8 ms.
[2026-05-26 14:42:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4787648329971752026.gal : 4 ms
[2026-05-26 14:42:11] [INFO ] Time to serialize properties into /tmp/CTLFireability13037899524070893160.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/CTLFireability4787648329971752026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13037899524070893160.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,5.27902e+06,9.13755,154048,2427,191,224751,2268,584,544213,84,20876,0
Converting to forward existential form...Done !
original formula: (EF(((A(((i2.u2.p8==1)&&(i2.u12.p37==1)) U (i6.i2.u34.p100==1)) * (i2.u2.p7==1)) * (i2.u11.p32==1))) * EG((AF(!(A((i2.u12.p36==1) U ((i4....226
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((!((E(!((i6.i2.u34.p100==1)) U (!(((i2.u2.p8==1)&&(i2.u12.p37==1))) * !((i6.i2.u34.p100=...447
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t41, t44, t45, t47, t55, t60, t65, t70, t75, t78, t79, t90, t95, t132, t133, t1...759
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 337
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 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 325
Applied a total of 16 rules in 9 ms. Remains 121 /128 variables (removed 7) and now considering 325/343 (removed 18) transitions.
[2026-05-26 14:42:41] [INFO ] Flow matrix only has 299 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-240997767348441599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3468034583288124102.kers'
[2026-05-26 14:42:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-240997767348441599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3468034583288124102.kers]
Normalized transition count is 298 out of 299 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 298 rows 121 cols 1016 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-26 14:42:41] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-3468034583288124102.kers
Total runtime 14 ms.
[2026-05-26 14:42:41] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-26 14:42:41] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2026-05-26 14:42:41] [INFO ] Invariant cache hit.
[2026-05-26 14:42:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 14:42:42] [INFO ] Implicit Places using invariants and state equation in 298 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 448 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/128 places, 325/343 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 459 ms. Remains : 120/128 places, 325/343 transitions.
[2026-05-26 14:42:42] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:42:42] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:42:42] [INFO ] Input system was already deterministic with 325 transitions.
[2026-05-26 14:42:42] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:42:42] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:42:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16398404155846285711.gal : 2 ms
[2026-05-26 14:42:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17304789195026219455.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/CTLFireability16398404155846285711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17304789195026219455.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,6.42548e+06,1.99856,46020,2,3037,5,117473,6,0,804,124000,0
Converting to forward existential form...Done !
original formula: EF(((A(EG((((p8==1)&&(p102==1))&&((p8==1)&&(p29==1)))) U EG(EF((p57==1)))) + ((p101==1) * EX(((p9==0)||(p120==0))))) + (((!(A(((p8==1)&&(...236
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EG(!(EG(E(TRUE U (p57==1))))))) * !(E(!(EG(E(TRUE U (p57==1)))) U (!(EG((((p8==1)&&(p10...580
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...681
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,28.4091,625552,1,0,817,3.4385e+06,684,458,6876,3.12625e+06,905
FORMULA FireWire-PT-09-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 337
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 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 330
Applied a total of 12 rules in 4 ms. Remains 123 /128 variables (removed 5) and now considering 330/343 (removed 13) transitions.
[2026-05-26 14:43:10] [INFO ] Flow matrix only has 304 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-2389224302673349505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14293510536380587353.kers'
[2026-05-26 14:43:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2389224302673349505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14293510536380587353.kers]
Normalized transition count is 303 out of 304 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 303 rows 123 cols 1034 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-26 14:43:10] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14293510536380587353.kers
Total runtime 2 ms.
[2026-05-26 14:43:11] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-26 14:43:11] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2026-05-26 14:43:11] [INFO ] Invariant cache hit.
[2026-05-26 14:43:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 14:43:11] [INFO ] Implicit Places using invariants and state equation in 493 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 608 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/128 places, 330/343 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 613 ms. Remains : 122/128 places, 330/343 transitions.
[2026-05-26 14:43:11] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:43:11] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:43:11] [INFO ] Input system was already deterministic with 330 transitions.
[2026-05-26 14:43:11] [INFO ] Flatten gal took : 21 ms
[2026-05-26 14:43:11] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:43:11] [INFO ] Time to serialize gal into /tmp/CTLFireability9207537381781966853.gal : 2 ms
[2026-05-26 14:43:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2404195177390039192.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/CTLFireability9207537381781966853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2404195177390039192.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,6.446e+06,2.26465,47416,2,2952,5,122193,6,0,817,129360,0
Converting to forward existential form...Done !
original formula: (((AX(A(((p9==1)&&(p16==1)) U ((p4==1)&&(p20==1)))) + EF((AX(((p7==0)||(p54==0))) * AG((p100==0))))) + (AX(AX(((p6==1)&&(p56==1)))) + AG(...317
=> equivalent forward existential formula: (([(EY(FwdU((((Init * !((E(TRUE U ((p8==0)||(p37==0))) * !((E(!(((p7==1)&&(p101==1))) U (!(((p6==1)&&(p59==1))) ...1442
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
Detected timeout of ITS tools.
[2026-05-26 14:43:41] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:43:41] [INFO ] Applying decomposition
[2026-05-26 14:43:41] [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/graph6858943629293371922.txt' '-o' '/tmp/graph6858943629293371922.bin' '-w' '/tmp/graph6858943629293371922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6858943629293371922.bin' '-l' '-1' '-v' '-w' '/tmp/graph6858943629293371922.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:43:41] [INFO ] Decomposing Gal with order
[2026-05-26 14:43:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:43:41] [INFO ] Removed a total of 513 redundant transitions.
[2026-05-26 14:43:41] [INFO ] Flatten gal took : 21 ms
[2026-05-26 14:43:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 6 ms.
[2026-05-26 14:43:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16467765999362722999.gal : 3 ms
[2026-05-26 14:43:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12435807550497533232.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/CTLFireability16467765999362722999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12435807550497533232.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,6.446e+06,17.9967,317580,2750,234,421651,2664,672,1.58112e+06,95,23821,0
Converting to forward existential form...Done !
original formula: (((AX(A(((i3.i0.u3.p9==1)&&(i1.i0.u5.p16==1)) U ((i1.i2.u1.p4==1)&&(i1.i1.u7.p20==1)))) + EF((AX(((i4.u2.p7==0)||(i4.u18.p54==0))) * AG((...483
=> equivalent forward existential formula: (([(EY(FwdU((((Init * !((E(TRUE U ((i4.u2.p8==0)||(i2.u12.p37==0))) * !((E(!(((i4.u2.p7==1)&&(i5.i1.u34.p101==1)...2056
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, t137...863
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 337
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 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 113 transition count 306
Applied a total of 32 rules in 12 ms. Remains 113 /128 variables (removed 15) and now considering 306/343 (removed 37) transitions.
[2026-05-26 14:44:11] [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-3462393930670392438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1644168426755586206.kers'
[2026-05-26 14:44:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3462393930670392438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1644168426755586206.kers]
Normalized transition count is 279 out of 280 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 113 cols 946 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 14:44:11] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1644168426755586206.kers
Total runtime 1 ms.
[2026-05-26 14:44:11] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-26 14:44:11] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:44:11] [INFO ] Invariant cache hit.
[2026-05-26 14:44:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:44:12] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 425 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/128 places, 306/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 439 ms. Remains : 112/128 places, 306/343 transitions.
[2026-05-26 14:44:12] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:44:12] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:44:12] [INFO ] Input system was already deterministic with 306 transitions.
[2026-05-26 14:44:12] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:44:12] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:44:12] [INFO ] Time to serialize gal into /tmp/CTLFireability5912331995892517674.gal : 2 ms
[2026-05-26 14:44:12] [INFO ] Time to serialize properties into /tmp/CTLFireability15593341509966668196.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/CTLFireability5912331995892517674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15593341509966668196.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,6.34422e+06,8.59651,184132,2,6955,5,474104,6,0,753,635071,0
Converting to forward existential form...Done !
original formula: AG(((EG(((AX(((p4==0)||(p93==0))) * (p9==1)) * (p43==1))) + (p9==0)) + (p92==0)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((p92==0))) * !((p9==0))) * !(EG(((!(EX(!(((p4==0)||(p93==0))))) * (p9==1)) * (p43==1))))...165
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...633
Using saturation style SCC detection
(forward)formula 0,0,11.0661,184356,1,0,578,502538,640,307,6587,635071,659
FORMULA FireWire-PT-09-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 339
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 126 transition count 337
Applied a total of 6 rules in 2 ms. Remains 126 /128 variables (removed 2) and now considering 337/343 (removed 6) transitions.
[2026-05-26 14:44:23] [INFO ] Flow matrix only has 311 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-16676247098087951152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12685350684436125208.kers'
[2026-05-26 14:44:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16676247098087951152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12685350684436125208.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 126 cols 1058 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-26 14:44:23] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12685350684436125208.kers
Total runtime 2 ms.
[2026-05-26 14:44:23] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-26 14:44:23] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2026-05-26 14:44:23] [INFO ] Invariant cache hit.
[2026-05-26 14:44:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:44:24] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2026-05-26 14:44:24] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2026-05-26 14:44:24] [INFO ] Invariant cache hit.
[2026-05-26 14:44:24] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (OVERLAPS) 310/436 variables, 126/139 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (OVERLAPS) 1/437 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 0/437 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 184 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (OVERLAPS) 310/436 variables, 126/139 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 336/519 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/437 variables, and 521 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 337/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60943 ms. Remains : 126/128 places, 337/343 transitions.
[2026-05-26 14:45:24] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:45:24] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:45:24] [INFO ] Input system was already deterministic with 337 transitions.
[2026-05-26 14:45:24] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:45:24] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:45:24] [INFO ] Time to serialize gal into /tmp/CTLFireability7343295902342823804.gal : 3 ms
[2026-05-26 14:45:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9676620542566824013.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/CTLFireability7343295902342823804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9676620542566824013.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,6.47696e+06,3.41016,74316,2,3000,5,216206,6,0,840,220672,0
Converting to forward existential form...Done !
original formula: E(((EG(!(E(((p8==1)&&(p28==1)) U (p58==1)))) + (EX(((p105==1)||(!((p13==1)&&(p25==1))))) * !(EF(AG(((p8==1)&&(p28==1))))))) + ((EX(AF((p1...234
=> equivalent forward existential formula: [((FwdU(Init,((EG(!(E(((p8==1)&&(p28==1)) U (p58==1)))) + (EX(((p105==1)||(!((p13==1)&&(p25==1))))) * !(E(TRUE U...313
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,...705
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-26 14:45:54] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:45:54] [INFO ] Applying decomposition
[2026-05-26 14:45:54] [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/graph6127707881414912259.txt' '-o' '/tmp/graph6127707881414912259.bin' '-w' '/tmp/graph6127707881414912259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6127707881414912259.bin' '-l' '-1' '-v' '-w' '/tmp/graph6127707881414912259.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:45:54] [INFO ] Decomposing Gal with order
[2026-05-26 14:45:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:45:54] [INFO ] Removed a total of 540 redundant transitions.
[2026-05-26 14:45:54] [INFO ] Flatten gal took : 30 ms
[2026-05-26 14:45:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 6 ms.
[2026-05-26 14:45:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11471432475508860857.gal : 4 ms
[2026-05-26 14:45:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14516457763524115749.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/CTLFireability11471432475508860857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14516457763524115749.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,6.47696e+06,24.8751,470396,3029,225,466308,4573,653,3.64846e+06,85,35930,0
Converting to forward existential form...Done !
original formula: E(((EG(!(E(((i3.u2.p8==1)&&(i1.u9.p28==1)) U (i3.u21.p58==1)))) + (EX(((i5.u37.p105==1)||(!((i1.u4.p13==1)&&(i2.i0.u5.p25==1))))) * !(EF(...334
=> equivalent forward existential formula: [((FwdU(Init,((EG(!(E(((i3.u2.p8==1)&&(i1.u9.p28==1)) U (i3.u21.p58==1)))) + (EX(((i5.u37.p105==1)||(!((i1.u4.p1...413
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t46, t47, t49, t57, t62, t67, t72, t77, t89, t90, t91, t92, t95, t97, t138, t140, t...837
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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 336
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 336
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 124 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 305
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 34 place count 111 transition count 304
Applied a total of 34 rules in 26 ms. Remains 111 /128 variables (removed 17) and now considering 304/343 (removed 39) transitions.
[2026-05-26 14:46:24] [INFO ] Flow matrix only has 278 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-9453570202458248020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6702611913254166664.kers'
[2026-05-26 14:46:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9453570202458248020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6702611913254166664.kers]
Normalized transition count is 277 out of 278 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 277 rows 110 cols 931 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-26 14:46:24] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6702611913254166664.kers
Total runtime 1 ms.
[2026-05-26 14:46:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-26 14:46:24] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 14:46:24] [INFO ] Invariant cache hit.
[2026-05-26 14:46:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:46:25] [INFO ] Implicit Places using invariants and state equation in 358 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 498 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/128 places, 304/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 532 ms. Remains : 110/128 places, 304/343 transitions.
[2026-05-26 14:46:25] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:46:25] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:46:25] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-26 14:46:25] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:46:25] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:46:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14247661914855280720.gal : 2 ms
[2026-05-26 14:46:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4907966056222028888.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/ReachabilityCardinality14247661914855280720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4907966056222028888.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 (2313 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1095 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality4907966056222028888.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 17
Finished probabilistic random walk after 16453 steps, run visited all 1 properties in 63 ms. (steps per millisecond=261 )
Probabilistic random walk after 16453 steps, saw 5339 distinct states, run finished after 63 ms. (steps per millisecond=261 ) properties seen :1
FORMULA FireWire-PT-09-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 22
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :22 after 36
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 126 transition count 338
Applied a total of 5 rules in 8 ms. Remains 126 /128 variables (removed 2) and now considering 338/343 (removed 5) transitions.
[2026-05-26 14:46:25] [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-16838122584216115871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13277494818809086560.kers'
[2026-05-26 14:46:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16838122584216115871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13277494818809086560.kers]
Normalized transition count is 311 out of 312 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 126 cols 1064 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-26 14:46:25] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13277494818809086560.kers
Total runtime 3 ms.
[2026-05-26 14:46:25] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-26 14:46:25] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2026-05-26 14:46:25] [INFO ] Invariant cache hit.
[2026-05-26 14:46:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:46:26] [INFO ] Implicit Places using invariants and state equation in 485 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 681 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 338/343 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 691 ms. Remains : 125/128 places, 338/343 transitions.
[2026-05-26 14:46:26] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:46:26] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:46:26] [INFO ] Input system was already deterministic with 338 transitions.
[2026-05-26 14:46:26] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:46:26] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:46:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1255605391279679583.gal : 2 ms
[2026-05-26 14:46:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9141706541433143445.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/CTLFireability1255605391279679583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9141706541433143445.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,6.64736e+06,3.63324,78184,2,2974,5,227017,6,0,837,236488,0
Converting to forward existential form...Done !
original formula: (AF(AX(AX(!(A(((p10==1)&&(p129==1)) U (p104==1)))))) * (EF((AF(((p9==1)&&(p47==1))) * AF((p104==1)))) + (EF(((p3==1)&&(p118==1))) * AF(EX...204
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(!(EX(!(!(!((E(!((p104==1)) U (!(((p10==1)&&(p129==1))) * !((p104==1)))) + EG(!((p104==1))))...448
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 14:46:56] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:46:56] [INFO ] Applying decomposition
[2026-05-26 14:46:56] [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/graph12160935819879871052.txt' '-o' '/tmp/graph12160935819879871052.bin' '-w' '/tmp/graph12160935819879871052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12160935819879871052.bin' '-l' '-1' '-v' '-w' '/tmp/graph12160935819879871052.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:46:56] [INFO ] Decomposing Gal with order
[2026-05-26 14:46:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:46:56] [INFO ] Removed a total of 541 redundant transitions.
[2026-05-26 14:46:56] [INFO ] Flatten gal took : 21 ms
[2026-05-26 14:46:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 6 ms.
[2026-05-26 14:46:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17944679735268983550.gal : 3 ms
[2026-05-26 14:46:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8151678987980967049.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/CTLFireability17944679735268983550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8151678987980967049.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,6.64736e+06,9.3014,185068,2585,144,221456,1752,674,1.14036e+06,84,11906,0
Converting to forward existential form...Done !
original formula: (AF(AX(AX(!(A(((i3.i0.u3.p10==1)&&(i6.i1.u36.p129==1)) U (i6.i1.u36.p104==1)))))) * (EF((AF(((i3.i0.u3.p9==1)&&(i3.i2.u15.p47==1))) * AF(...306
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(!(EX(!(!(!((E(!((i6.i1.u36.p104==1)) U (!(((i3.i0.u3.p10==1)&&(i6.i1.u36.p129==1))) * !((i6...599
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t91, t94, t96, t133, t134, t135, t...858
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 3
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 343/343 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 339
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 126 transition count 337
Applied a total of 6 rules in 2 ms. Remains 126 /128 variables (removed 2) and now considering 337/343 (removed 6) transitions.
[2026-05-26 14:47:26] [INFO ] Flow matrix only has 311 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-17148126026790714872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3500331181030889892.kers'
[2026-05-26 14:47:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17148126026790714872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3500331181030889892.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 126 cols 1058 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-26 14:47:26] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3500331181030889892.kers
Total runtime 2 ms.
[2026-05-26 14:47:26] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-26 14:47:26] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2026-05-26 14:47:26] [INFO ] Invariant cache hit.
[2026-05-26 14:47:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:47:27] [INFO ] Implicit Places using invariants and state equation in 475 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 625 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 337/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 337/337 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 630 ms. Remains : 125/128 places, 337/343 transitions.
[2026-05-26 14:47:27] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:47:27] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:47:27] [INFO ] Input system was already deterministic with 337 transitions.
[2026-05-26 14:47:27] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:47:27] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:47:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11508624928443760269.gal : 2 ms
[2026-05-26 14:47:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13502174404872370302.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/CTLFireability11508624928443760269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13502174404872370302.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,6.47696e+06,3.22859,71124,2,2927,5,206987,6,0,836,215654,0
Converting to forward existential form...Done !
original formula: E(!(((p10==1)&&(p22==1))) U (((p8==1)&&(p106==1)) + (((!((!(EG(((p70==1)&&(p115==1)))) + AX(((p8==1)&&(p64==1))))) * EG((((p3==1)&&(p124=...320
=> equivalent forward existential formula: ([(FwdU(Init,!(((p10==1)&&(p22==1)))) * ((p8==1)&&(p106==1)))] != FALSE + [((((FwdU(Init,!(((p10==1)&&(p22==1)))...440
Hit Full ! (commute/partial/dont) 292/0/45
(forward)formula 0,1,6.55465,99776,1,0,10,275549,16,1,1624,280392,4
FORMULA FireWire-PT-09-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 14:47:33] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:47:33] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:47:33] [INFO ] Applying decomposition
[2026-05-26 14:47:33] [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/graph16933166087658346260.txt' '-o' '/tmp/graph16933166087658346260.bin' '-w' '/tmp/graph16933166087658346260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16933166087658346260.bin' '-l' '-1' '-v' '-w' '/tmp/graph16933166087658346260.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:47:33] [INFO ] Decomposing Gal with order
[2026-05-26 14:47:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:47:33] [INFO ] Removed a total of 535 redundant transitions.
[2026-05-26 14:47:33] [INFO ] Flatten gal took : 18 ms
[2026-05-26 14:47:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 7 ms.
[2026-05-26 14:47:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6551771569838977732.gal : 3 ms
[2026-05-26 14:47:33] [INFO ] Time to serialize properties into /tmp/CTLFireability10220417232688269530.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/CTLFireability6551771569838977732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10220417232688269530.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 6 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,6.8441e+06,33.1056,499212,2596,121,793256,1364,608,1.3174e+06,104,7944,0
Converting to forward existential form...Done !
original formula: (EG(EX(((i0.u0.p3==0)||(i2.i0.u21.p78==0)))) * EG(EF(((i3.u3.p9==1)&&(i5.u16.p45==1)))))
=> equivalent forward existential formula: [FwdG((Init * EG(EX(((i0.u0.p3==0)||(i2.i0.u21.p78==0))))),E(TRUE U ((i3.u3.p9==1)&&(i5.u16.p45==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t46, t47, t49, t57, t62, t67, t72, t77, t81, t92, t95, t97, t134, t135, t136, ...785
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 7
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 7
Using saturation style SCC detection
Fast SCC detection found a local 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 7
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 7
(forward)formula 0,1,98.6109,1436400,1,0,2.61511e+06,5370,3272,3.82136e+06,486,46734,5029918
FORMULA FireWire-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EX((AX(EG(((i0.u0.p3==1)&&(i0.u39.p124==1)))) + AX((EG(((i5.u2.p8==0)||(i7.u31.p103==0))) * AG(((i0.u0.p3==0)||(i6.u28.p94==0))))))) * E...315
=> equivalent forward existential formula: [(FwdU((Init * EX((!(EX(!(EG(((i0.u0.p3==1)&&(i0.u39.p124==1)))))) + !(EX(!((EG(((i5.u2.p8==0)||(i7.u31.p103==0)...494
(forward)formula 1,0,127.841,1994708,1,0,3.52464e+06,7935,3364,5.40092e+06,490,61675,6932219
FORMULA FireWire-PT-09-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EF(((A(((i5.u2.p8==1)&&(i4.u9.p37==1)) U (i7.u30.p100==1)) * (i5.u2.p7==1)) * (i4.u9.p32==1))) * EG((AF(!(A((i4.u9.p36==1) U ((i3.u3.p9=...217
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((!((E(!((i7.u30.p100==1)) U (!(((i5.u2.p8==1)&&(i4.u9.p37==1))) * !((i7.u30.p100==1)))) ...426
Using saturation style SCC detection
(forward)formula 2,1,220.018,2200964,1,0,3.86274e+06,8322,2209,5.94057e+06,303,63265,6235362
FORMULA FireWire-PT-09-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (((AX(A(((i3.u3.p9==1)&&(i1.u8.p16==1)) U ((i1.u1.p4==1)&&(i1.u6.p20==1)))) + EF((AX(((i5.u2.p7==0)||(i5.u15.p54==0))) * AG((i7.u30.p100=...454
=> equivalent forward existential formula: (([(EY(FwdU((((Init * !((E(TRUE U ((i5.u2.p8==0)||(i4.u9.p37==0))) * !((E(!(((i5.u2.p7==1)&&(i7.u30.p101==1))) U...1919
(forward)formula 3,1,236.539,2200964,1,0,3.91316e+06,8322,2365,6.15581e+06,316,63265,7565800
FORMULA FireWire-PT-09-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
ITS-tools command line returned an error code 139
[2026-05-26 14:52:02] [INFO ] Applying decomposition
[2026-05-26 14:52:02] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:52:02] [INFO ] Decomposing Gal with order
[2026-05-26 14:52:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:52:02] [INFO ] Removed a total of 432 redundant transitions.
[2026-05-26 14:52:02] [INFO ] Flatten gal took : 25 ms
[2026-05-26 14:52:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 3 ms.
[2026-05-26 14:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12048188211570642823.gal : 1 ms
[2026-05-26 14:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2245560574155862864.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/CTLFireability12048188211570642823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2245560574155862864.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 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,6.8441e+06,0.479569,18516,381,1318,9701,15337,163,24576,372,120717,0
Converting to forward existential form...Done !
original formula: E(((EG(!(E(((u1.p8==1)&&(u3.p28==1)) U (u5.p58==1)))) + (EX(((u9.p105==1)||(!((u2.p13==1)&&(u3.p25==1))))) * !(EF(AG(((u1.p8==1)&&(u3.p28...276
=> equivalent forward existential formula: [((FwdU(Init,((EG(!(E(((u1.p8==1)&&(u3.p28==1)) U (u5.p58==1)))) + (EX(((u9.p105==1)||(!((u2.p13==1)&&(u3.p25==1...355
Reverse transition relation is NOT exact ! Due to transitions t82, t94, t95, t139, t178, t194, t195, t222, t245, t294, t295, t309, t312, t319, t321, t324, ...485
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Using saturation style SCC detection
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
(forward)formula 0,1,9.85008,279864,1,0,370193,161894,1112,666603,1742,988081,584949
FORMULA FireWire-PT-09-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (AF(AX(AX(!(A(((u1.p10==1)&&(u9.p129==1)) U (u9.p104==1)))))) * (EF((AF(((u1.p9==1)&&(u5.p47==1))) * AF((u9.p104==1)))) + (EF(((u1.p3==1)...240
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(!(EX(!(!(!((E(!((u9.p104==1)) U (!(((u1.p10==1)&&(u9.p129==1))) * !((u9.p104==1)))) + EG(!(...499
(forward)formula 1,1,20.7163,570220,1,0,811736,243562,1181,1.3845e+06,1751,1.60795e+06,1397783
FORMULA FireWire-PT-09-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 1071437 ms.
BK_STOP 1779807143620
--------------------
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-09"
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-09, 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-177955809000210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 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 ;