About the Execution of ITS-Tools for FireWire-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6333.852 | 3600000.00 | 3821656.00 | 10825.50 | TT???T????????T? | 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-177955809000282.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FireWire-PT-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000282
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.9K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 168K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779839570426
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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 23:52:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 23:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 23:52:52] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2026-05-26 23:52:52] [INFO ] Transformed 437 places.
[2026-05-26 23:52:52] [INFO ] Transformed 707 transitions.
[2026-05-26 23:52:52] [INFO ] Found NUPN structural information;
[2026-05-26 23:52:53] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Support contains 111 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 427 transition count 707
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 92 place count 345 transition count 625
Iterating global reduction 1 with 82 rules applied. Total rules applied 174 place count 345 transition count 625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 175 place count 345 transition count 624
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 187 place count 333 transition count 609
Iterating global reduction 2 with 12 rules applied. Total rules applied 199 place count 333 transition count 609
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 200 place count 332 transition count 608
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 332 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 332 transition count 607
Applied a total of 202 rules in 159 ms. Remains 332 /437 variables (removed 105) and now considering 607/707 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17710699390944085998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16889672724284975301.kers'
[2026-05-26 23:52:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17710699390944085998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16889672724284975301.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 607 rows 332 cols 1935 entries
Finished phase 1 with 325 SingleSign rule and 0 generalized
[2026-05-26 23:52:53] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16889672724284975301.kers
Total runtime 5 ms.
[2026-05-26 23:52:54] [INFO ] Implicit Places using invariants in 818 ms returned []
[2026-05-26 23:52:54] [INFO ] Invariant cache hit.
[2026-05-26 23:52:55] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2026-05-26 23:52:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 332/939 variables, and 21 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/332 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/939 variables, and 33 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/332 constraints, PredecessorRefiner: 0/606 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60760ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60802ms
Starting structural reductions in LTL mode, iteration 1 : 332/437 places, 607/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62800 ms. Remains : 332/437 places, 607/707 transitions.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Applied a total of 0 rules in 13 ms. Remains 332 /332 variables (removed 0) and now considering 607/607 (removed 0) transitions.
[2026-05-26 23:53:55] [INFO ] Invariant cache hit.
[2026-05-26 23:53:56] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-26 23:53:56] [INFO ] Invariant cache hit.
[2026-05-26 23:53:57] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1114 ms. Remains : 332/332 places, 607/607 transitions.
Support contains 111 out of 332 places after structural reductions.
[2026-05-26 23:53:57] [INFO ] Flatten gal took : 164 ms
[2026-05-26 23:53:57] [INFO ] Flatten gal took : 97 ms
[2026-05-26 23:53:57] [INFO ] Input system was already deterministic with 607 transitions.
Support contains 110 out of 332 places (down from 111) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 81 to 80
RANDOM walk for 40000 steps (15 resets) in 3017 ms. (13 steps per ms) remains 64/80 properties
BEST_FIRST walk for 4004 steps (9 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (11 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (10 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (10 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 40 ms. (97 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 37 ms. (105 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 28 ms. (138 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (9 resets) in 27 ms. (142 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 28 ms. (138 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 31 ms. (125 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (9 resets) in 26 ms. (148 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
[2026-05-26 23:53:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 207/300 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 7/307 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 586/893 variables, 307/314 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 26/919 variables, 14/328 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 0/328 constraints. Problems are: Problem set: 1 solved, 60 unsolved
SMT process timed out in 5075ms, After SMT, problems are : Problem set: 1 solved, 60 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 90 out of 332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 332/332 places, 607/607 transitions.
Graph (trivial) has 136 edges and 332 vertex of which 6 / 332 are part of one of the 2 SCC in 18 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 328 transition count 579
Reduce places removed 21 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 307 transition count 575
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 303 transition count 575
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 51 place count 303 transition count 558
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 85 place count 286 transition count 558
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 284 transition count 556
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 284 transition count 556
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 143 place count 257 transition count 529
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 175 place count 241 transition count 582
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 241 transition count 580
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 184 place count 241 transition count 573
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 191 place count 234 transition count 573
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 197 place count 234 transition count 573
Applied a total of 197 rules in 284 ms. Remains 234 /332 variables (removed 98) and now considering 573/607 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 234/332 places, 573/607 transitions.
RANDOM walk for 40000 steps (24 resets) in 1131 ms. (35 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (19 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (14 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (21 resets) in 30 ms. (129 steps per ms) remains 58/60 properties
BEST_FIRST walk for 4003 steps (15 resets) in 40 ms. (97 steps per ms) remains 56/58 properties
BEST_FIRST walk for 4001 steps (15 resets) in 44 ms. (88 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4001 steps (13 resets) in 65 ms. (60 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (21 resets) in 52 ms. (75 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4002 steps (18 resets) in 60 ms. (65 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (25 resets) in 52 ms. (75 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (22 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (13 resets) in 103 ms. (38 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (23 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (14 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (23 resets) in 96 ms. (41 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (16 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (16 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (13 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (15 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (17 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (20 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (17 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (17 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (14 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (20 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (16 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (19 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 51/54 properties
BEST_FIRST walk for 4001 steps (24 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (21 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (20 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (16 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (22 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (15 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (15 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (22 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (19 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (22 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (12 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4000 steps (18 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (17 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (19 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (20 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (17 resets) in 22 ms. (173 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (19 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (14 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
[2026-05-26 23:54:06] [INFO ] Flow matrix only has 567 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3934289237822178812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7088396159884374799.kers'
[2026-05-26 23:54:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3934289237822178812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7088396159884374799.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 567 rows 234 cols 2052 entries
Finished phase 1 with 227 SingleSign rule and 0 generalized
[2026-05-26 23:54:06] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7088396159884374799.kers
Total runtime 4 ms.
[2026-05-26 23:54:06] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 140/221 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 3/224 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 567/791 variables, 224/231 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/791 variables, 11/242 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/791 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 10/801 variables, 10/252 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/801 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/801 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 801/801 variables, and 252 constraints, problems are : Problem set: 0 solved, 50 unsolved in 4348 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 234/234 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 140/221 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 3/224 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 567/791 variables, 224/242 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 11/253 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/791 variables, 47/300 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/791 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/791 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/791 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 14 (OVERLAPS) 10/801 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/801 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/801 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 801/801 variables, and 316 constraints, problems are : Problem set: 0 solved, 50 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 234/234 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49408ms problems are : Problem set: 0 solved, 50 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 233 transition count 572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 233 transition count 570
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 231 transition count 570
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 230 transition count 569
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 230 transition count 569
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 229 transition count 568
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 226 transition count 595
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 226 transition count 594
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 225 transition count 594
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 225 transition count 594
Applied a total of 20 rules in 130 ms. Remains 225 /234 variables (removed 9) and now considering 594/573 (removed -21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 225/234 places, 594/573 transitions.
RANDOM walk for 40000 steps (28 resets) in 563 ms. (70 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (17 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (15 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (14 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (19 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (17 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (14 resets) in 34 ms. (114 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (23 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (13 resets) in 28 ms. (137 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (17 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (12 resets) in 28 ms. (137 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (14 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (23 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (20 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (14 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (9 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (19 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (14 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (16 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (13 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (17 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (24 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4002 steps (20 resets) in 27 ms. (142 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (20 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (16 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (15 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4001 steps (19 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (17 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (26 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (19 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (12 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (10 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (19 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (17 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (13 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (16 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (18 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (15 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (20 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
Interrupted probabilistic random walk after 223000 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :17 out of 48
Probabilistic random walk after 223000 steps, saw 61694 distinct states, run finished after 3011 ms. (steps per millisecond=74 ) properties seen :17
[2026-05-26 23:54:59] [INFO ] Flow matrix only has 588 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2583882058141616306.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10635440876456524145.kers'
[2026-05-26 23:54:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2583882058141616306.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10635440876456524145.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 588 rows 225 cols 2166 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-26 23:54:59] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10635440876456524145.kers
Total runtime 4 ms.
[2026-05-26 23:54:59] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 151/206 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 8/214 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 585/799 variables, 214/221 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 11/232 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/799 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 14/813 variables, 11/243 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/813 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/813 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 243 constraints, problems are : Problem set: 0 solved, 31 unsolved in 2321 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 225/225 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 151/206 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 8/214 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 585/799 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/799 variables, 11/240 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/799 variables, 29/269 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/799 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 14/813 variables, 11/280 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/813 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/813 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 0/813 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 282 constraints, problems are : Problem set: 0 solved, 31 unsolved in 30307 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 225/225 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32665ms problems are : Problem set: 0 solved, 31 unsolved
Parikh walk visited 4 properties in 15897 ms.
Support contains 48 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 594/594 transitions.
Graph (trivial) has 56 edges and 225 vertex of which 4 / 225 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 223 transition count 585
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 219 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 218 transition count 584
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 11 place count 218 transition count 577
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 25 place count 211 transition count 577
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 29 place count 207 transition count 573
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 207 transition count 573
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 36 place count 207 transition count 570
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 54 place count 198 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 198 transition count 559
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 62 place count 195 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 67 place count 195 transition count 582
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 74 place count 195 transition count 575
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 83 place count 188 transition count 573
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 91 place count 188 transition count 565
Applied a total of 91 rules in 83 ms. Remains 188 /225 variables (removed 37) and now considering 565/594 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 188/225 places, 565/594 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-26 23:55:47] [INFO ] Flatten gal took : 43 ms
[2026-05-26 23:55:48] [INFO ] Flatten gal took : 51 ms
[2026-05-26 23:55:48] [INFO ] Input system was already deterministic with 607 transitions.
Computed a total of 101 stabilizing places and 155 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 310 transition count 582
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 310 transition count 582
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 299 transition count 529
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 299 transition count 529
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 299 transition count 528
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 295 transition count 521
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 295 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 294 transition count 518
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 294 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 293 transition count 516
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 293 transition count 516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 292 transition count 513
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 292 transition count 513
Applied a total of 81 rules in 37 ms. Remains 292 /332 variables (removed 40) and now considering 513/607 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14436476284009850317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16890482637646861789.kers'
[2026-05-26 23:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14436476284009850317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16890482637646861789.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 513 rows 292 cols 1624 entries
Finished phase 1 with 285 SingleSign rule and 0 generalized
[2026-05-26 23:55:48] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16890482637646861789.kers
Total runtime 6 ms.
[2026-05-26 23:55:48] [INFO ] Implicit Places using invariants in 331 ms returned []
[2026-05-26 23:55:48] [INFO ] Invariant cache hit.
[2026-05-26 23:55:49] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2026-05-26 23:55:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/805 variables, and 18 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 513/805 variables, 292/310 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/805 variables, 512/822 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 822 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 292/332 places, 513/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61374 ms. Remains : 292/332 places, 513/607 transitions.
[2026-05-26 23:56:49] [INFO ] Flatten gal took : 66 ms
[2026-05-26 23:56:49] [INFO ] Flatten gal took : 57 ms
[2026-05-26 23:56:49] [INFO ] Input system was already deterministic with 513 transitions.
[2026-05-26 23:56:49] [INFO ] Flatten gal took : 37 ms
[2026-05-26 23:56:49] [INFO ] Flatten gal took : 35 ms
[2026-05-26 23:56:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6404464122170826792.gal : 34 ms
[2026-05-26 23:56:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16562946731290477648.ctl : 7 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/CTLFireability6404464122170826792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16562946731290477648.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.
Detected timeout of ITS tools.
[2026-05-26 23:57:20] [INFO ] Flatten gal took : 46 ms
[2026-05-26 23:57:20] [INFO ] Applying decomposition
[2026-05-26 23:57:20] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10667150986479625009.txt' '-o' '/tmp/graph10667150986479625009.bin' '-w' '/tmp/graph10667150986479625009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10667150986479625009.bin' '-l' '-1' '-v' '-w' '/tmp/graph10667150986479625009.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:57:20] [INFO ] Decomposing Gal with order
[2026-05-26 23:57:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:57:20] [INFO ] Removed a total of 593 redundant transitions.
[2026-05-26 23:57:20] [INFO ] Flatten gal took : 186 ms
[2026-05-26 23:57:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 36 ms.
[2026-05-26 23:57:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16820046271779990891.gal : 21 ms
[2026-05-26 23:57:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12282317506139523755.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/CTLFireability16820046271779990891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12282317506139523755.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 314 transition count 588
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 314 transition count 588
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 308 transition count 560
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 308 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 308 transition count 559
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 306 transition count 555
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 306 transition count 555
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 305 transition count 552
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 305 transition count 552
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 304 transition count 550
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 304 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 303 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 303 transition count 547
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 302 transition count 545
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 302 transition count 545
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 301 transition count 542
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 301 transition count 542
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 300 transition count 540
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 300 transition count 540
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 299 transition count 537
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 299 transition count 537
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 298 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 298 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 297 transition count 532
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 297 transition count 532
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 296 transition count 530
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 296 transition count 530
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 295 transition count 528
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 295 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 294 transition count 526
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 294 transition count 526
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 293 transition count 525
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 293 transition count 525
Applied a total of 79 rules in 93 ms. Remains 293 /332 variables (removed 39) and now considering 525/607 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17679375950469827337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8561100745442943256.kers'
[2026-05-26 23:57:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17679375950469827337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8561100745442943256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 525 rows 293 cols 1655 entries
Finished phase 1 with 286 SingleSign rule and 0 generalized
[2026-05-26 23:57:51] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8561100745442943256.kers
Total runtime 5 ms.
[2026-05-26 23:57:51] [INFO ] Implicit Places using invariants in 326 ms returned []
[2026-05-26 23:57:51] [INFO ] Invariant cache hit.
[2026-05-26 23:57:51] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2026-05-26 23:57:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/818 variables, and 18 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/293 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 525/818 variables, 293/313 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 837 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 293/332 places, 525/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61216 ms. Remains : 293/332 places, 525/607 transitions.
[2026-05-26 23:58:52] [INFO ] Flatten gal took : 17 ms
[2026-05-26 23:58:52] [INFO ] Flatten gal took : 17 ms
[2026-05-26 23:58:52] [INFO ] Input system was already deterministic with 525 transitions.
[2026-05-26 23:58:52] [INFO ] Flatten gal took : 17 ms
[2026-05-26 23:58:52] [INFO ] Flatten gal took : 16 ms
[2026-05-26 23:58:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1295873959139709408.gal : 5 ms
[2026-05-26 23:58:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15945235321853550518.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/CTLFireability1295873959139709408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15945235321853550518.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.
Detected timeout of ITS tools.
[2026-05-26 23:59:22] [INFO ] Flatten gal took : 15 ms
[2026-05-26 23:59:22] [INFO ] Applying decomposition
[2026-05-26 23:59:22] [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/graph11353384405504895467.txt' '-o' '/tmp/graph11353384405504895467.bin' '-w' '/tmp/graph11353384405504895467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11353384405504895467.bin' '-l' '-1' '-v' '-w' '/tmp/graph11353384405504895467.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:59:22] [INFO ] Decomposing Gal with order
[2026-05-26 23:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:59:22] [INFO ] Removed a total of 573 redundant transitions.
[2026-05-26 23:59:22] [INFO ] Flatten gal took : 38 ms
[2026-05-26 23:59:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 15 ms.
[2026-05-26 23:59:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1173524283789558627.gal : 6 ms
[2026-05-26 23:59:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13325182916045412458.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/CTLFireability1173524283789558627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13325182916045412458.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,3.20054e+10,22.3908,473460,2247,90,513112,2872,1111,3.72953e+06,101,7395,0
Converting to forward existential form...Done !
original formula: A((E((((i3.i1.u3.p12==1)&&(i3.i1.u96.p419==1)) + EG(((i3.i1.u3.p12==1)&&(i10.i2.u90.p395==1)))) U ((((i3.i1.u4.p14==1)&&(i10.i2.u77.p343=...712
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U EX(!(EG(!((i11.u87.p368==1)))))) + (!(E(TRUE U !(((EX(((i8.i1.u64.p294==1)&&(i12.u69....1681
Reverse transition relation is NOT exact ! Due to transitions t60, t67, t104, t157, t189, t197, t202, t211, t213, t220, t228, t252, t256, t260, t261, t262,...1345
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 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 a local SCC at level 5
Fast SCC detection found an SCC at level 6
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Graph (trivial) has 226 edges and 332 vertex of which 11 / 332 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 323 transition count 555
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 281 transition count 553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 280 transition count 553
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 88 place count 280 transition count 532
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 130 place count 259 transition count 532
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 149 place count 240 transition count 491
Iterating global reduction 3 with 19 rules applied. Total rules applied 168 place count 240 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 240 transition count 490
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 169 place count 240 transition count 487
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 175 place count 237 transition count 487
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 182 place count 230 transition count 476
Iterating global reduction 4 with 7 rules applied. Total rules applied 189 place count 230 transition count 476
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 230 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 229 transition count 474
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 194 place count 227 transition count 470
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 227 transition count 470
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 224 place count 213 transition count 456
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 228 place count 209 transition count 430
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 209 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 209 transition count 429
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 234 place count 208 transition count 426
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 208 transition count 426
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 236 place count 207 transition count 424
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 207 transition count 424
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 238 place count 206 transition count 421
Iterating global reduction 7 with 1 rules applied. Total rules applied 239 place count 206 transition count 421
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 240 place count 205 transition count 419
Iterating global reduction 7 with 1 rules applied. Total rules applied 241 place count 205 transition count 419
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 242 place count 204 transition count 416
Iterating global reduction 7 with 1 rules applied. Total rules applied 243 place count 204 transition count 416
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 244 place count 203 transition count 414
Iterating global reduction 7 with 1 rules applied. Total rules applied 245 place count 203 transition count 414
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 246 place count 202 transition count 411
Iterating global reduction 7 with 1 rules applied. Total rules applied 247 place count 202 transition count 411
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 248 place count 201 transition count 409
Iterating global reduction 7 with 1 rules applied. Total rules applied 249 place count 201 transition count 409
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 250 place count 200 transition count 406
Iterating global reduction 7 with 1 rules applied. Total rules applied 251 place count 200 transition count 406
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 252 place count 199 transition count 404
Iterating global reduction 7 with 1 rules applied. Total rules applied 253 place count 199 transition count 404
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 254 place count 198 transition count 402
Iterating global reduction 7 with 1 rules applied. Total rules applied 255 place count 198 transition count 402
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 256 place count 197 transition count 400
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 197 transition count 400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 258 place count 196 transition count 399
Applied a total of 258 rules in 134 ms. Remains 196 /332 variables (removed 136) and now considering 399/607 (removed 208) transitions.
[2026-05-26 23:59:52] [INFO ] Flow matrix only has 395 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14394743336986248128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14524404423593236927.kers'
[2026-05-26 23:59:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14394743336986248128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14524404423593236927.kers]
Normalized transition count is 394 out of 395 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 394 rows 196 cols 1320 entries
Finished phase 1 with 189 SingleSign rule and 0 generalized
[2026-05-26 23:59:52] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14524404423593236927.kers
Total runtime 5 ms.
[2026-05-26 23:59:52] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-26 23:59:53] [INFO ] Flow matrix only has 395 transitions (discarded 4 similar events)
[2026-05-26 23:59:53] [INFO ] Invariant cache hit.
[2026-05-26 23:59:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-26 23:59:53] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2026-05-26 23:59:53] [INFO ] Redundant transitions in 42 ms returned []
Running 390 sub problems to find dead transitions.
[2026-05-26 23:59:53] [INFO ] Flow matrix only has 395 transitions (discarded 4 similar events)
[2026-05-26 23:59:53] [INFO ] Invariant cache hit.
[2026-05-26 23:59:53] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (OVERLAPS) 394/588 variables, 194/209 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/591 variables, and 213 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/196 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 394/588 variables, 194/212 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 390/604 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/591 variables, and 604 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/196 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/332 places, 399/607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61310 ms. Remains : 196/332 places, 399/607 transitions.
[2026-05-27 00:00:53] [INFO ] Flatten gal took : 12 ms
[2026-05-27 00:00:53] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:00:53] [INFO ] Input system was already deterministic with 399 transitions.
[2026-05-27 00:00:53] [INFO ] Flatten gal took : 11 ms
[2026-05-27 00:00:54] [INFO ] Flatten gal took : 11 ms
[2026-05-27 00:00:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14265187956586222233.gal : 3 ms
[2026-05-27 00:00:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14514373102178283826.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/CTLFireability14265187956586222233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14514373102178283826.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22797e+09,18.2559,347936,2,11949,5,745707,6,0,1179,1.35683e+06,0
Converting to forward existential form...Done !
original formula: E((p355==1) U EG((!(AG(EF(((p294==1)&&(p322==1))))) + ((A((p71==1) U EF(((p19==1)&&(p151==1)))) * (p46==1)) * (p213==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(p355==1)),(!(!(E(TRUE U !(E(TRUE U ((p294==1)&&(p322==1))))))) + ((!((E(!(E(TRUE U ((p19==1)&&(...300
Hit Full ! (commute/partial/dont) 397/0/2
Reverse transition relation is NOT exact ! Due to transitions t4, t25, t28, t32, t34, t39, t41, t65, t75, t84, t86, t92, t93, t94, t98, t99, t102, t106, t1...782
Detected timeout of ITS tools.
[2026-05-27 00:01:24] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:01:24] [INFO ] Applying decomposition
[2026-05-27 00:01:24] [INFO ] Flatten gal took : 9 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/graph7530947259058781998.txt' '-o' '/tmp/graph7530947259058781998.bin' '-w' '/tmp/graph7530947259058781998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7530947259058781998.bin' '-l' '-1' '-v' '-w' '/tmp/graph7530947259058781998.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:01:24] [INFO ] Decomposing Gal with order
[2026-05-27 00:01:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:01:24] [INFO ] Removed a total of 499 redundant transitions.
[2026-05-27 00:01:24] [INFO ] Flatten gal took : 42 ms
[2026-05-27 00:01:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 15 ms.
[2026-05-27 00:01:24] [INFO ] Time to serialize gal into /tmp/CTLFireability7600534376464592489.gal : 7 ms
[2026-05-27 00:01:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14184473075245785285.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/CTLFireability7600534376464592489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14184473075245785285.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22797e+09,11.6993,246040,1705,47,286079,612,863,1.77812e+06,73,2571,0
Converting to forward existential form...Done !
original formula: E((i0.i1.u46.p355==1) U EG((!(AG(EF(((i6.u40.p294==1)&&(i10.u48.p322==1))))) + ((A((i1.u9.p71==1) U EF(((i11.i1.u3.p19==1)&&(i4.u21.p151=...208
=> equivalent forward existential formula: [FwdG(FwdU(Init,(i0.i1.u46.p355==1)),(!(!(E(TRUE U !(E(TRUE U ((i6.u40.p294==1)&&(i10.u48.p322==1))))))) + ((!((...401
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t98, t99, t102, t105, t106, t108, t122, t127, t128, t134, t137, t139, t166, t1...1034
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 307 transition count 560
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 307 transition count 560
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 295 transition count 503
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 295 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 76 place count 295 transition count 501
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 291 transition count 493
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 291 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 289 transition count 488
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 289 transition count 488
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 287 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 287 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 285 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 285 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 283 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 283 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 281 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 281 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 279 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 279 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 277 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 277 transition count 458
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 275 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 275 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 273 transition count 448
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 273 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 271 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 271 transition count 444
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 269 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 269 transition count 440
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 267 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 267 transition count 437
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 266 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 266 transition count 436
Applied a total of 134 rules in 82 ms. Remains 266 /332 variables (removed 66) and now considering 436/607 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15345124623868767890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-928205696194322417.kers'
[2026-05-27 00:01:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15345124623868767890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-928205696194322417.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 436 rows 266 cols 1322 entries
Finished phase 1 with 259 SingleSign rule and 0 generalized
[2026-05-27 00:01:54] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-928205696194322417.kers
Total runtime 4 ms.
[2026-05-27 00:01:54] [INFO ] Implicit Places using invariants in 324 ms returned []
[2026-05-27 00:01:54] [INFO ] Invariant cache hit.
[2026-05-27 00:01:55] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2026-05-27 00:01:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
SMT process timed out in 30094ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 30097ms
Starting structural reductions in LTL mode, iteration 1 : 266/332 places, 436/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31182 ms. Remains : 266/332 places, 436/607 transitions.
[2026-05-27 00:02:25] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:02:25] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:02:25] [INFO ] Input system was already deterministic with 436 transitions.
[2026-05-27 00:02:25] [INFO ] Flatten gal took : 17 ms
[2026-05-27 00:02:25] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:02:25] [INFO ] Time to serialize gal into /tmp/CTLFireability7653633564565175957.gal : 4 ms
[2026-05-27 00:02:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13630077868378122132.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/CTLFireability7653633564565175957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13630077868378122132.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,2.51456e+10,29.0053,595708,2,22453,5,1.2969e+06,6,0,1500,2.81372e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-27 00:02:55] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:02:55] [INFO ] Applying decomposition
[2026-05-27 00:02:55] [INFO ] Flatten gal took : 9 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/graph11105240308068127948.txt' '-o' '/tmp/graph11105240308068127948.bin' '-w' '/tmp/graph11105240308068127948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11105240308068127948.bin' '-l' '-1' '-v' '-w' '/tmp/graph11105240308068127948.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:02:55] [INFO ] Decomposing Gal with order
[2026-05-27 00:02:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:02:55] [INFO ] Removed a total of 449 redundant transitions.
[2026-05-27 00:02:55] [INFO ] Flatten gal took : 31 ms
[2026-05-27 00:02:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 6 ms.
[2026-05-27 00:02:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15303142091919911904.gal : 5 ms
[2026-05-27 00:02:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17919543423758575104.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/CTLFireability15303142091919911904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17919543423758575104.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Graph (trivial) has 228 edges and 332 vertex of which 11 / 332 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 323 transition count 556
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 282 transition count 554
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 281 transition count 553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 280 transition count 553
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 88 place count 280 transition count 534
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 126 place count 261 transition count 534
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 146 place count 241 transition count 492
Iterating global reduction 4 with 20 rules applied. Total rules applied 166 place count 241 transition count 492
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 241 transition count 491
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 167 place count 241 transition count 486
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 177 place count 236 transition count 486
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 185 place count 228 transition count 473
Iterating global reduction 5 with 8 rules applied. Total rules applied 193 place count 228 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 195 place count 228 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 196 place count 227 transition count 471
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 198 place count 225 transition count 467
Iterating global reduction 7 with 2 rules applied. Total rules applied 200 place count 225 transition count 467
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 228 place count 211 transition count 453
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 232 place count 207 transition count 427
Iterating global reduction 7 with 4 rules applied. Total rules applied 236 place count 207 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 237 place count 207 transition count 426
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 238 place count 206 transition count 423
Iterating global reduction 8 with 1 rules applied. Total rules applied 239 place count 206 transition count 423
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 240 place count 205 transition count 421
Iterating global reduction 8 with 1 rules applied. Total rules applied 241 place count 205 transition count 421
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 242 place count 204 transition count 418
Iterating global reduction 8 with 1 rules applied. Total rules applied 243 place count 204 transition count 418
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 244 place count 203 transition count 416
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 203 transition count 416
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 246 place count 202 transition count 413
Iterating global reduction 8 with 1 rules applied. Total rules applied 247 place count 202 transition count 413
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 248 place count 201 transition count 411
Iterating global reduction 8 with 1 rules applied. Total rules applied 249 place count 201 transition count 411
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 250 place count 200 transition count 408
Iterating global reduction 8 with 1 rules applied. Total rules applied 251 place count 200 transition count 408
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 252 place count 199 transition count 406
Iterating global reduction 8 with 1 rules applied. Total rules applied 253 place count 199 transition count 406
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 254 place count 198 transition count 403
Iterating global reduction 8 with 1 rules applied. Total rules applied 255 place count 198 transition count 403
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 256 place count 197 transition count 401
Iterating global reduction 8 with 1 rules applied. Total rules applied 257 place count 197 transition count 401
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 258 place count 196 transition count 399
Iterating global reduction 8 with 1 rules applied. Total rules applied 259 place count 196 transition count 399
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 260 place count 195 transition count 397
Iterating global reduction 8 with 1 rules applied. Total rules applied 261 place count 195 transition count 397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 262 place count 194 transition count 396
Applied a total of 262 rules in 226 ms. Remains 194 /332 variables (removed 138) and now considering 396/607 (removed 211) transitions.
[2026-05-27 00:03:26] [INFO ] Flow matrix only has 392 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4595118636412614583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10092215221391269732.kers'
[2026-05-27 00:03:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4595118636412614583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10092215221391269732.kers]
Normalized transition count is 391 out of 392 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 391 rows 194 cols 1312 entries
Finished phase 1 with 187 SingleSign rule and 0 generalized
[2026-05-27 00:03:26] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10092215221391269732.kers
Total runtime 4 ms.
[2026-05-27 00:03:26] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-27 00:03:26] [INFO ] Flow matrix only has 392 transitions (discarded 4 similar events)
[2026-05-27 00:03:26] [INFO ] Invariant cache hit.
[2026-05-27 00:03:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-27 00:03:26] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2026-05-27 00:03:26] [INFO ] Redundant transitions in 12 ms returned []
Running 387 sub problems to find dead transitions.
[2026-05-27 00:03:26] [INFO ] Flow matrix only has 392 transitions (discarded 4 similar events)
[2026-05-27 00:03:26] [INFO ] Invariant cache hit.
[2026-05-27 00:03:26] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 391/583 variables, 192/209 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 2/585 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/586 variables, and 213 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 391/583 variables, 192/209 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 387/598 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/586 variables, and 598 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in SI_CTL mode, iteration 1 : 194/332 places, 396/607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61103 ms. Remains : 194/332 places, 396/607 transitions.
[2026-05-27 00:04:27] [INFO ] Flatten gal took : 20 ms
[2026-05-27 00:04:27] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:04:27] [INFO ] Input system was already deterministic with 396 transitions.
[2026-05-27 00:04:27] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:04:27] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:04:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6010894840849588702.gal : 3 ms
[2026-05-27 00:04:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4647007962685344858.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/CTLFireability6010894840849588702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4647007962685344858.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29543e+09,17.8255,355576,2,12479,5,779156,6,0,1168,1.43686e+06,0
Converting to forward existential form...Done !
original formula: AF((EF((p170==1)) + ((EG(((p14==0)||(p324==0))) * !(E((((p43==1)&&(p204==1))&&(p107==1)) U EF(((p55==1)&&(p430==1)))))) * EF((p429==0))))...156
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (p170==1)) + ((EG(((p14==0)||(p324==0))) * !(E((((p43==1)&&(p204==1))&&(p107==1)) U E(TRU...219
Reverse transition relation is NOT exact ! Due to transitions t4, t24, t30, t32, t37, t39, t63, t72, t79, t81, t88, t89, t90, t94, t95, t98, t101, t102, t1...782
Detected timeout of ITS tools.
[2026-05-27 00:04:57] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:04:57] [INFO ] Applying decomposition
[2026-05-27 00:04:57] [INFO ] Flatten gal took : 15 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/graph15335805770570851695.txt' '-o' '/tmp/graph15335805770570851695.bin' '-w' '/tmp/graph15335805770570851695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15335805770570851695.bin' '-l' '-1' '-v' '-w' '/tmp/graph15335805770570851695.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:04:57] [INFO ] Decomposing Gal with order
[2026-05-27 00:04:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:04:57] [INFO ] Removed a total of 501 redundant transitions.
[2026-05-27 00:04:57] [INFO ] Flatten gal took : 35 ms
[2026-05-27 00:04:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 19 ms.
[2026-05-27 00:04:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2940800607395053198.gal : 7 ms
[2026-05-27 00:04:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2947452126042346070.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/CTLFireability2940800607395053198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2947452126042346070.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,1.29543e+09,12.9767,207272,2131,82,249167,676,831,1.15117e+06,79,3560,0
Converting to forward existential form...Done !
original formula: AF((EF((i4.u27.p170==1)) + ((EG(((i0.i2.u1.p14==0)||(i0.i2.u45.p324==0))) * !(E((((i4.u4.p43==1)&&(i5.i1.u33.p204==1))&&(i2.u11.p107==1))...234
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (i4.u27.p170==1)) + ((EG(((i0.i2.u1.p14==0)||(i0.i2.u45.p324==0))) * !(E((((i4.u4.p43==1)...297
Reverse transition relation is NOT exact ! Due to transitions t88, t89, t90, t94, t95, t98, t104, t109, t114, t119, t124, t133, t135, t162, t172, t177, t18...994
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Graph (trivial) has 229 edges and 332 vertex of which 11 / 332 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 323 transition count 558
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 284 transition count 558
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 79 place count 284 transition count 537
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 121 place count 263 transition count 537
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 140 place count 244 transition count 515
Iterating global reduction 2 with 19 rules applied. Total rules applied 159 place count 244 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 244 transition count 514
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 160 place count 244 transition count 510
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 168 place count 240 transition count 510
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 176 place count 232 transition count 497
Iterating global reduction 3 with 8 rules applied. Total rules applied 184 place count 232 transition count 497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 232 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 231 transition count 495
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 190 place count 228 transition count 488
Iterating global reduction 5 with 3 rules applied. Total rules applied 193 place count 228 transition count 488
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 227 transition count 486
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 227 transition count 486
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 226 transition count 483
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 226 transition count 483
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 225 transition count 481
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 225 transition count 481
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 224 transition count 478
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 224 transition count 478
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 202 place count 223 transition count 476
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 223 transition count 476
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 222 transition count 473
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 222 transition count 473
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 221 transition count 471
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 221 transition count 471
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 237 place count 206 transition count 456
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 241 place count 202 transition count 430
Iterating global reduction 5 with 4 rules applied. Total rules applied 245 place count 202 transition count 430
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 246 place count 201 transition count 427
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 201 transition count 427
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 248 place count 200 transition count 425
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 200 transition count 425
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 250 place count 199 transition count 422
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 199 transition count 422
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 252 place count 198 transition count 420
Iterating global reduction 5 with 1 rules applied. Total rules applied 253 place count 198 transition count 420
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 254 place count 197 transition count 417
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 197 transition count 417
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 196 transition count 415
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 196 transition count 415
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 258 place count 195 transition count 412
Iterating global reduction 5 with 1 rules applied. Total rules applied 259 place count 195 transition count 412
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 260 place count 194 transition count 410
Iterating global reduction 5 with 1 rules applied. Total rules applied 261 place count 194 transition count 410
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 262 place count 193 transition count 407
Iterating global reduction 5 with 1 rules applied. Total rules applied 263 place count 193 transition count 407
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 264 place count 192 transition count 405
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 192 transition count 405
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 266 place count 191 transition count 403
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 191 transition count 403
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 268 place count 190 transition count 401
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 190 transition count 401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 189 transition count 400
Applied a total of 270 rules in 97 ms. Remains 189 /332 variables (removed 143) and now considering 400/607 (removed 207) transitions.
[2026-05-27 00:05:27] [INFO ] Flow matrix only has 396 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14851361743336863597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3750227936850503945.kers'
[2026-05-27 00:05:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14851361743336863597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3750227936850503945.kers]
Normalized transition count is 395 out of 396 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 395 rows 189 cols 1320 entries
Finished phase 1 with 182 SingleSign rule and 0 generalized
[2026-05-27 00:05:27] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3750227936850503945.kers
Total runtime 3 ms.
[2026-05-27 00:05:27] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-27 00:05:27] [INFO ] Flow matrix only has 396 transitions (discarded 4 similar events)
[2026-05-27 00:05:27] [INFO ] Invariant cache hit.
[2026-05-27 00:05:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-27 00:05:28] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2026-05-27 00:05:28] [INFO ] Redundant transitions in 6 ms returned []
Running 390 sub problems to find dead transitions.
[2026-05-27 00:05:28] [INFO ] Flow matrix only has 396 transitions (discarded 4 similar events)
[2026-05-27 00:05:28] [INFO ] Invariant cache hit.
[2026-05-27 00:05:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (OVERLAPS) 395/582 variables, 187/203 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/585 variables, and 205 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 187/189 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 395/582 variables, 187/204 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 390/596 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SMT process timed out in 60131ms, After SMT, problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in SI_CTL mode, iteration 1 : 189/332 places, 400/607 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61246 ms. Remains : 189/332 places, 400/607 transitions.
[2026-05-27 00:06:28] [INFO ] Flatten gal took : 12 ms
[2026-05-27 00:06:28] [INFO ] Flatten gal took : 13 ms
[2026-05-27 00:06:28] [INFO ] Input system was already deterministic with 400 transitions.
[2026-05-27 00:06:28] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:06:28] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:06:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14157437160923083408.gal : 2 ms
[2026-05-27 00:06:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7585577653687519040.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/CTLFireability14157437160923083408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7585577653687519040.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40265e+09,17.8242,320332,2,11115,5,746727,6,0,1152,1.29233e+06,0
Converting to forward existential form...Done !
original formula: AG((AF((((p271==0)||(((p41==0)||(p182==0))&&((p19==0)||(p151==0))))||((p14==1)&&(p332==1)))) + AF(AG(((p43==1)&&(p171==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!(EG(!((((p271==0)||(((p41==0)||(p182==0))&&((p19==0)||(p151==0))))||((p14==1)&&(p332...217
Reverse transition relation is NOT exact ! Due to transitions t2, t22, t28, t30, t35, t38, t63, t73, t81, t83, t91, t92, t93, t97, t98, t101, t104, t105, t...740
Detected timeout of ITS tools.
[2026-05-27 00:06:58] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:06:58] [INFO ] Applying decomposition
[2026-05-27 00:06:58] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph319132474921838747.txt' '-o' '/tmp/graph319132474921838747.bin' '-w' '/tmp/graph319132474921838747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph319132474921838747.bin' '-l' '-1' '-v' '-w' '/tmp/graph319132474921838747.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:06:58] [INFO ] Decomposing Gal with order
[2026-05-27 00:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:06:58] [INFO ] Removed a total of 513 redundant transitions.
[2026-05-27 00:06:58] [INFO ] Flatten gal took : 23 ms
[2026-05-27 00:06:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 12 ms.
[2026-05-27 00:06:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5073726082676785087.gal : 4 ms
[2026-05-27 00:06:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8076636619023535894.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/CTLFireability5073726082676785087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8076636619023535894.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,1.40265e+09,13.7315,316004,2732,79,382658,1578,807,2.40041e+06,80,6563,0
Converting to forward existential form...Done !
original formula: AG((AF((((i6.u40.p271==0)||(((i0.i0.u6.p41==0)||(i0.i0.u31.p182==0))&&((i8.i0.u3.p19==0)||(i3.u26.p151==0))))||((i8.i0.u2.p14==1)&&(i8.i0...224
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!(EG(!((((i6.u40.p271==0)||(((i0.i0.u6.p41==0)||(i0.i0.u31.p182==0))&&((i8.i0.u3.p19=...297
Reverse transition relation is NOT exact ! Due to transitions t91, t92, t93, t97, t98, t101, t104, t105, t107, t121, t171, t189, t192, t193, t195, t199, t2...1035
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,16.1332,316004,1,0,382658,1578,5013,2.40041e+06,395,6563,550397
FORMULA FireWire-PT-18-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 307 transition count 560
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 307 transition count 560
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 295 transition count 503
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 295 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 76 place count 295 transition count 501
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 291 transition count 493
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 291 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 290 transition count 491
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 290 transition count 491
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 289 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 289 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 288 transition count 486
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 288 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 287 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 287 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 286 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 286 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 285 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 285 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 284 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 284 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 283 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 283 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 282 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 282 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 281 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 281 transition count 469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 280 transition count 467
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 280 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 279 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 279 transition count 466
Applied a total of 108 rules in 56 ms. Remains 279 /332 variables (removed 53) and now considering 466/607 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15368080066178675556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14939450273483108887.kers'
[2026-05-27 00:07:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15368080066178675556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14939450273483108887.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 466 rows 279 cols 1440 entries
Finished phase 1 with 272 SingleSign rule and 0 generalized
[2026-05-27 00:07:15] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14939450273483108887.kers
Total runtime 4 ms.
[2026-05-27 00:07:15] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-27 00:07:15] [INFO ] Invariant cache hit.
[2026-05-27 00:07:16] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2026-05-27 00:07:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 279/745 variables, and 15 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/279 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 6 (OVERLAPS) 466/745 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 465/761 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 745/745 variables, and 761 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 279/332 places, 466/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61284 ms. Remains : 279/332 places, 466/607 transitions.
[2026-05-27 00:08:16] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:08:16] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:08:16] [INFO ] Input system was already deterministic with 466 transitions.
[2026-05-27 00:08:16] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:08:16] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:08:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8864927057436995936.gal : 2 ms
[2026-05-27 00:08:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14200121153657335316.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/CTLFireability8864927057436995936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14200121153657335316.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.
Detected timeout of ITS tools.
[2026-05-27 00:08:46] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:08:46] [INFO ] Applying decomposition
[2026-05-27 00:08:46] [INFO ] Flatten gal took : 9 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/graph7931931503510298553.txt' '-o' '/tmp/graph7931931503510298553.bin' '-w' '/tmp/graph7931931503510298553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7931931503510298553.bin' '-l' '-1' '-v' '-w' '/tmp/graph7931931503510298553.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:08:46] [INFO ] Decomposing Gal with order
[2026-05-27 00:08:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:08:46] [INFO ] Removed a total of 503 redundant transitions.
[2026-05-27 00:08:46] [INFO ] Flatten gal took : 38 ms
[2026-05-27 00:08:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 9 ms.
[2026-05-27 00:08:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9760331359346987109.gal : 7 ms
[2026-05-27 00:08:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2765268003180504201.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/CTLFireability9760331359346987109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2765268003180504201.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 308 transition count 561
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 308 transition count 561
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 298 transition count 526
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 298 transition count 526
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 70 place count 298 transition count 524
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 295 transition count 518
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 295 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 294 transition count 515
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 294 transition count 515
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 293 transition count 513
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 293 transition count 513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 292 transition count 510
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 292 transition count 510
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 291 transition count 508
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 291 transition count 508
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 290 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 290 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 289 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 289 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 288 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 288 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 287 transition count 498
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 287 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 286 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 286 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 285 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 285 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 284 transition count 491
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 284 transition count 491
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 283 transition count 489
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 283 transition count 489
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 282 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 282 transition count 488
Applied a total of 102 rules in 47 ms. Remains 282 /332 variables (removed 50) and now considering 488/607 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11492066259759357908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2788842856113253804.kers'
[2026-05-27 00:09:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11492066259759357908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2788842856113253804.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 488 rows 282 cols 1524 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-05-27 00:09:16] [INFO ] Computed 7 invariants in 10 ms
Computed 7 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-2788842856113253804.kers
Total runtime 33 ms.
[2026-05-27 00:09:17] [INFO ] Implicit Places using invariants in 419 ms returned []
[2026-05-27 00:09:17] [INFO ] Invariant cache hit.
[2026-05-27 00:09:17] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
Running 487 sub problems to find dead transitions.
[2026-05-27 00:09:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 282/770 variables, and 18 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/282 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/770 variables, and 34 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/282 constraints, PredecessorRefiner: 0/487 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 282/332 places, 488/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61300 ms. Remains : 282/332 places, 488/607 transitions.
[2026-05-27 00:10:18] [INFO ] Flatten gal took : 16 ms
[2026-05-27 00:10:18] [INFO ] Flatten gal took : 19 ms
[2026-05-27 00:10:18] [INFO ] Input system was already deterministic with 488 transitions.
[2026-05-27 00:10:18] [INFO ] Flatten gal took : 18 ms
[2026-05-27 00:10:18] [INFO ] Flatten gal took : 16 ms
[2026-05-27 00:10:18] [INFO ] Time to serialize gal into /tmp/CTLFireability18317481932995246849.gal : 4 ms
[2026-05-27 00:10:18] [INFO ] Time to serialize properties into /tmp/CTLFireability5227881018113934747.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/CTLFireability18317481932995246849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5227881018113934747.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.
Detected timeout of ITS tools.
[2026-05-27 00:10:48] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:10:48] [INFO ] Applying decomposition
[2026-05-27 00:10:48] [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/graph14628469673839566603.txt' '-o' '/tmp/graph14628469673839566603.bin' '-w' '/tmp/graph14628469673839566603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14628469673839566603.bin' '-l' '-1' '-v' '-w' '/tmp/graph14628469673839566603.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:10:48] [INFO ] Decomposing Gal with order
[2026-05-27 00:10:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:10:48] [INFO ] Removed a total of 543 redundant transitions.
[2026-05-27 00:10:48] [INFO ] Flatten gal took : 24 ms
[2026-05-27 00:10:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 5 ms.
[2026-05-27 00:10:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10784103922419496585.gal : 4 ms
[2026-05-27 00:10:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3638018054778255170.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/CTLFireability10784103922419496585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3638018054778255170.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,2.71194e+10,11.7992,256824,2340,68,223589,571,1015,2.11726e+06,83,2125,0
Converting to forward existential form...Done !
original formula: EF((A(((AF((i2.i1.u13.p71==1)) * (i8.i2.u63.p294==1)) * (i11.u68.p322==1)) U (EX(AF(((i9.u4.p25==1)&&(i6.i1.u52.p224==1)))) * (i12.i1.u84...454
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!((EX(!(EG(!(((i9.u4.p25==1)&&(i6.i1.u52.p224==1)))))) * (i12.i1.u84.p369==1)))))) * ...919
Reverse transition relation is NOT exact ! Due to transitions t66, t144, t151, t189, t194, t203, t205, t212, t218, t220, t244, t248, t251, t252, t253, t256...1182
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 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 a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 310 transition count 582
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 310 transition count 582
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 298 transition count 544
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 298 transition count 544
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 298 transition count 543
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 293 transition count 533
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 293 transition count 533
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 291 transition count 528
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 291 transition count 528
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 289 transition count 523
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 289 transition count 523
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 287 transition count 518
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 287 transition count 518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 285 transition count 513
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 285 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 283 transition count 508
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 283 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 281 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 281 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 279 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 279 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 278 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 278 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 277 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 277 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 276 transition count 491
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 276 transition count 491
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 275 transition count 489
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 275 transition count 489
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 274 transition count 487
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 274 transition count 487
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 273 transition count 486
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 273 transition count 486
Applied a total of 119 rules in 43 ms. Remains 273 /332 variables (removed 59) and now considering 486/607 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15283477306772311629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1838192662252151095.kers'
[2026-05-27 00:11:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15283477306772311629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1838192662252151095.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 486 rows 273 cols 1520 entries
Finished phase 1 with 266 SingleSign rule and 0 generalized
[2026-05-27 00:11:18] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1838192662252151095.kers
Total runtime 6 ms.
[2026-05-27 00:11:18] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-27 00:11:18] [INFO ] Invariant cache hit.
[2026-05-27 00:11:19] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Running 485 sub problems to find dead transitions.
[2026-05-27 00:11:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 273/759 variables, and 19 constraints, problems are : Problem set: 0 solved, 485 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/273 constraints, PredecessorRefiner: 485/485 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 485 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/759 variables, and 29 constraints, problems are : Problem set: 0 solved, 485 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/273 constraints, PredecessorRefiner: 0/485 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 485 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 273/332 places, 486/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61009 ms. Remains : 273/332 places, 486/607 transitions.
[2026-05-27 00:12:19] [INFO ] Flatten gal took : 16 ms
[2026-05-27 00:12:19] [INFO ] Flatten gal took : 16 ms
[2026-05-27 00:12:19] [INFO ] Input system was already deterministic with 486 transitions.
[2026-05-27 00:12:19] [INFO ] Flatten gal took : 17 ms
[2026-05-27 00:12:19] [INFO ] Flatten gal took : 16 ms
[2026-05-27 00:12:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8993610779936422792.gal : 4 ms
[2026-05-27 00:12:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2615980410423937905.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/CTLFireability8993610779936422792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2615980410423937905.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.
Detected timeout of ITS tools.
[2026-05-27 00:12:49] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:12:49] [INFO ] Applying decomposition
[2026-05-27 00:12:49] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3877291977319578512.txt' '-o' '/tmp/graph3877291977319578512.bin' '-w' '/tmp/graph3877291977319578512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3877291977319578512.bin' '-l' '-1' '-v' '-w' '/tmp/graph3877291977319578512.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:12:49] [INFO ] Decomposing Gal with order
[2026-05-27 00:12:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:12:49] [INFO ] Removed a total of 540 redundant transitions.
[2026-05-27 00:12:49] [INFO ] Flatten gal took : 25 ms
[2026-05-27 00:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 8 ms.
[2026-05-27 00:12:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1126352059870914530.gal : 5 ms
[2026-05-27 00:12:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10735723875276839001.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/CTLFireability1126352059870914530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10735723875276839001.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 309 transition count 562
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 309 transition count 562
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 299 transition count 526
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 299 transition count 526
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 299 transition count 524
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 297 transition count 519
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 297 transition count 519
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 296 transition count 517
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 296 transition count 517
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 295 transition count 514
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 295 transition count 514
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 294 transition count 512
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 294 transition count 512
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 293 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 293 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 292 transition count 507
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 292 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 291 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 291 transition count 504
Applied a total of 84 rules in 41 ms. Remains 291 /332 variables (removed 41) and now considering 504/607 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2537280787822041892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9697202430939889213.kers'
[2026-05-27 00:13:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2537280787822041892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9697202430939889213.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 504 rows 291 cols 1579 entries
Finished phase 1 with 284 SingleSign rule and 0 generalized
[2026-05-27 00:13:19] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9697202430939889213.kers
Total runtime 3 ms.
[2026-05-27 00:13:20] [INFO ] Implicit Places using invariants in 234 ms returned []
[2026-05-27 00:13:20] [INFO ] Invariant cache hit.
[2026-05-27 00:13:20] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2026-05-27 00:13:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 503 unsolved
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Starting structural reductions in LTL mode, iteration 1 : 291/332 places, 504/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30904 ms. Remains : 291/332 places, 504/607 transitions.
[2026-05-27 00:13:50] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:13:50] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:13:50] [INFO ] Input system was already deterministic with 504 transitions.
[2026-05-27 00:13:50] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:13:50] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:13:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3374011672349169531.gal : 2 ms
[2026-05-27 00:13:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7736124765198078149.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/CTLFireability3374011672349169531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7736124765198078149.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.
Detected timeout of ITS tools.
[2026-05-27 00:14:21] [INFO ] Flatten gal took : 11 ms
[2026-05-27 00:14:21] [INFO ] Applying decomposition
[2026-05-27 00:14:21] [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/graph14116521112125663679.txt' '-o' '/tmp/graph14116521112125663679.bin' '-w' '/tmp/graph14116521112125663679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14116521112125663679.bin' '-l' '-1' '-v' '-w' '/tmp/graph14116521112125663679.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:14:21] [INFO ] Decomposing Gal with order
[2026-05-27 00:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:14:21] [INFO ] Removed a total of 564 redundant transitions.
[2026-05-27 00:14:21] [INFO ] Flatten gal took : 39 ms
[2026-05-27 00:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 9 ms.
[2026-05-27 00:14:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17430990376571493825.gal : 8 ms
[2026-05-27 00:14:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6656373532467045813.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/CTLFireability17430990376571493825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6656373532467045813.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,2.96602e+10,14.1244,243232,2400,59,336533,802,1107,1.13424e+06,77,3348,0
Converting to forward existential form...Done !
original formula: AG(!(A(((i4.i0.u9.p52==1)&&(i4.i0.u83.p331==1)) U (((EF((i4.i0.u8.p47==1)) * EX(((i5.i0.u1.p25==1)&&(i9.i0.u97.p370==1)))) * ((((i1.i2.u1...307
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((((E(TRUE U (i4.i0.u8.p47==1)) * EX(((i5.i0.u1.p25==1)&&(i9.i0.u97.p370==1)))) * (((...877
Reverse transition relation is NOT exact ! Due to transitions t59, t66, t154, t187, t193, t198, t207, t216, t221, t222, t224, t229, t234, t239, t244, t248,...1213
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 306 transition count 559
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 306 transition count 559
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 293 transition count 501
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 293 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 293 transition count 499
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 288 transition count 489
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 288 transition count 489
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 287 transition count 487
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 287 transition count 487
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 286 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 286 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 285 transition count 482
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 285 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 284 transition count 479
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 284 transition count 479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 283 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 283 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 282 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 282 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 281 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 281 transition count 472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 280 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 280 transition count 469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 279 transition count 467
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 279 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 278 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 278 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 277 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 277 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 276 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 276 transition count 462
Applied a total of 114 rules in 52 ms. Remains 276 /332 variables (removed 56) and now considering 462/607 (removed 145) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6114714216040524162.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2160796487650404040.kers'
[2026-05-27 00:14:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6114714216040524162.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2160796487650404040.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 276 cols 1430 entries
Finished phase 1 with 269 SingleSign rule and 0 generalized
[2026-05-27 00:14:51] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2160796487650404040.kers
Total runtime 4 ms.
[2026-05-27 00:14:51] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-27 00:14:51] [INFO ] Invariant cache hit.
[2026-05-27 00:14:52] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-27 00:14:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/738 variables, and 24 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/276 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (OVERLAPS) 462/738 variables, 276/303 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 461/764 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/738 variables, and 765 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 276/332 places, 462/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61050 ms. Remains : 276/332 places, 462/607 transitions.
[2026-05-27 00:15:52] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:15:52] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:15:52] [INFO ] Input system was already deterministic with 462 transitions.
[2026-05-27 00:15:52] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:15:52] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:15:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15882499640862812979.gal : 3 ms
[2026-05-27 00:15:52] [INFO ] Time to serialize properties into /tmp/CTLFireability657440473897749977.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/CTLFireability15882499640862812979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability657440473897749977.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.
Detected timeout of ITS tools.
[2026-05-27 00:16:22] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:16:22] [INFO ] Applying decomposition
[2026-05-27 00:16:22] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6682184104222578860.txt' '-o' '/tmp/graph6682184104222578860.bin' '-w' '/tmp/graph6682184104222578860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6682184104222578860.bin' '-l' '-1' '-v' '-w' '/tmp/graph6682184104222578860.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:16:22] [INFO ] Decomposing Gal with order
[2026-05-27 00:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:16:22] [INFO ] Removed a total of 508 redundant transitions.
[2026-05-27 00:16:22] [INFO ] Flatten gal took : 33 ms
[2026-05-27 00:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 7 ms.
[2026-05-27 00:16:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1227101945153194778.gal : 7 ms
[2026-05-27 00:16:22] [INFO ] Time to serialize properties into /tmp/CTLFireability4402791653817530417.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/CTLFireability1227101945153194778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4402791653817530417.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 308 transition count 562
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 308 transition count 562
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 297 transition count 507
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 297 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 297 transition count 506
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 292 transition count 496
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 292 transition count 496
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 290 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 290 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 288 transition count 486
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 288 transition count 486
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 286 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 286 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 284 transition count 476
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 284 transition count 476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 282 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 282 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 280 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 280 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 278 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 278 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 277 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 277 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 276 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 276 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 275 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 275 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 274 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 274 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 273 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 273 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 272 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 272 transition count 449
Applied a total of 121 rules in 85 ms. Remains 272 /332 variables (removed 60) and now considering 449/607 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12841121311806044325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7218332036295044517.kers'
[2026-05-27 00:16:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12841121311806044325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7218332036295044517.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 449 rows 272 cols 1370 entries
Finished phase 1 with 265 SingleSign rule and 0 generalized
[2026-05-27 00:16:52] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7218332036295044517.kers
Total runtime 4 ms.
[2026-05-27 00:16:53] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-27 00:16:53] [INFO ] Invariant cache hit.
[2026-05-27 00:16:53] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2026-05-27 00:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 272/721 variables, and 18 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/272 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 449/721 variables, 272/290 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/721 variables, 448/738 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 721/721 variables, and 743 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 272/332 places, 449/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61083 ms. Remains : 272/332 places, 449/607 transitions.
[2026-05-27 00:17:53] [INFO ] Flatten gal took : 13 ms
[2026-05-27 00:17:53] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:17:53] [INFO ] Input system was already deterministic with 449 transitions.
[2026-05-27 00:17:53] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:17:53] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:17:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12144626562197964979.gal : 3 ms
[2026-05-27 00:17:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6492878197161473386.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/CTLFireability12144626562197964979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6492878197161473386.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.
Detected timeout of ITS tools.
[2026-05-27 00:18:23] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:18:23] [INFO ] Applying decomposition
[2026-05-27 00:18:23] [INFO ] Flatten gal took : 9 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/graph6031453863234067864.txt' '-o' '/tmp/graph6031453863234067864.bin' '-w' '/tmp/graph6031453863234067864.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6031453863234067864.bin' '-l' '-1' '-v' '-w' '/tmp/graph6031453863234067864.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:18:23] [INFO ] Decomposing Gal with order
[2026-05-27 00:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:18:23] [INFO ] Removed a total of 475 redundant transitions.
[2026-05-27 00:18:23] [INFO ] Flatten gal took : 20 ms
[2026-05-27 00:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 6 ms.
[2026-05-27 00:18:24] [INFO ] Time to serialize gal into /tmp/CTLFireability366026665494492249.gal : 4 ms
[2026-05-27 00:18:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14154625603667181771.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/CTLFireability366026665494492249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14154625603667181771.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 307 transition count 560
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 307 transition count 560
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 294 transition count 502
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 294 transition count 502
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 294 transition count 500
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 289 transition count 490
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 289 transition count 490
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 287 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 287 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 285 transition count 480
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 285 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 283 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 283 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 281 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 281 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 279 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 279 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 277 transition count 460
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 277 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 275 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 275 transition count 455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 274 transition count 453
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 274 transition count 453
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 273 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 273 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 272 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 272 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 271 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 271 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 270 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 270 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 269 transition count 443
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 269 transition count 443
Applied a total of 128 rules in 49 ms. Remains 269 /332 variables (removed 63) and now considering 443/607 (removed 164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10341867626308991362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-366885329600233735.kers'
[2026-05-27 00:18:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10341867626308991362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-366885329600233735.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 443 rows 269 cols 1352 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-27 00:18:54] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-366885329600233735.kers
Total runtime 3 ms.
[2026-05-27 00:18:54] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-27 00:18:54] [INFO ] Invariant cache hit.
[2026-05-27 00:18:54] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2026-05-27 00:18:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 443/712 variables, 269/287 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 712/712 variables, and 289 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 443/712 variables, 269/289 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/712 variables, 442/731 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 712/712 variables, and 731 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 269/332 places, 443/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61046 ms. Remains : 269/332 places, 443/607 transitions.
[2026-05-27 00:19:55] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:19:55] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:19:55] [INFO ] Input system was already deterministic with 443 transitions.
[2026-05-27 00:19:55] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:19:55] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:19:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13591893467647702995.gal : 3 ms
[2026-05-27 00:19:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14556551929011767400.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/CTLFireability13591893467647702995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14556551929011767400.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.
Detected timeout of ITS tools.
[2026-05-27 00:20:25] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:20:25] [INFO ] Applying decomposition
[2026-05-27 00:20:25] [INFO ] Flatten gal took : 9 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/graph1189569525992993009.txt' '-o' '/tmp/graph1189569525992993009.bin' '-w' '/tmp/graph1189569525992993009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1189569525992993009.bin' '-l' '-1' '-v' '-w' '/tmp/graph1189569525992993009.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:20:25] [INFO ] Decomposing Gal with order
[2026-05-27 00:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:20:25] [INFO ] Removed a total of 470 redundant transitions.
[2026-05-27 00:20:25] [INFO ] Flatten gal took : 20 ms
[2026-05-27 00:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-27 00:20:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17407542006597839455.gal : 4 ms
[2026-05-27 00:20:25] [INFO ] Time to serialize properties into /tmp/CTLFireability998399375312344902.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/CTLFireability17407542006597839455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability998399375312344902.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,2.67084e+10,23.17,430132,3412,98,566814,1790,1093,2.56068e+06,98,6541,0
Converting to forward existential form...Done !
original formula: AX(!(E(((i1.i0.u9.p51==1)&&(i1.i0.u68.p425==1)) U !(EF((i4.i2.u21.p101==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),((i1.i0.u9.p51==1)&&(i1.i0.u68.p425==1))) * !(E(TRUE U (i4.i2.u21.p101==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t57, t64, t141, t148, t187, t188, t190, t199, t208, t213, t214, t216, t221, t226, t231, t236,...1158
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 308 transition count 561
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 308 transition count 561
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 296 transition count 505
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 296 transition count 505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 74 place count 296 transition count 503
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 292 transition count 496
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 292 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 291 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 291 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 290 transition count 491
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 290 transition count 491
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 289 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 289 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 288 transition count 486
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 288 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 287 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 287 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 286 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 286 transition count 481
Applied a total of 94 rules in 57 ms. Remains 286 /332 variables (removed 46) and now considering 481/607 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14403967892883444964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8355256559908903465.kers'
[2026-05-27 00:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14403967892883444964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8355256559908903465.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 286 cols 1498 entries
Finished phase 1 with 279 SingleSign rule and 0 generalized
[2026-05-27 00:20:55] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8355256559908903465.kers
Total runtime 5 ms.
[2026-05-27 00:20:55] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-05-27 00:20:55] [INFO ] Invariant cache hit.
[2026-05-27 00:20:56] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2026-05-27 00:20:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/767 variables, and 21 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/286 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 481/767 variables, 286/313 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 480/793 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/767 variables, and 793 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 286/332 places, 481/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61233 ms. Remains : 286/332 places, 481/607 transitions.
[2026-05-27 00:21:56] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:21:56] [INFO ] Flatten gal took : 17 ms
[2026-05-27 00:21:56] [INFO ] Input system was already deterministic with 481 transitions.
[2026-05-27 00:21:56] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:21:56] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:21:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11033375683864278123.gal : 2 ms
[2026-05-27 00:21:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5059749765086584071.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/CTLFireability11033375683864278123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5059749765086584071.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.
Detected timeout of ITS tools.
[2026-05-27 00:22:26] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:22:26] [INFO ] Applying decomposition
[2026-05-27 00:22:26] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1240589102894955687.txt' '-o' '/tmp/graph1240589102894955687.bin' '-w' '/tmp/graph1240589102894955687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1240589102894955687.bin' '-l' '-1' '-v' '-w' '/tmp/graph1240589102894955687.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:22:26] [INFO ] Decomposing Gal with order
[2026-05-27 00:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:22:26] [INFO ] Removed a total of 529 redundant transitions.
[2026-05-27 00:22:26] [INFO ] Flatten gal took : 20 ms
[2026-05-27 00:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 4 ms.
[2026-05-27 00:22:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16228816176767730202.gal : 4 ms
[2026-05-27 00:22:26] [INFO ] Time to serialize properties into /tmp/CTLFireability413004807378259525.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/CTLFireability16228816176767730202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability413004807378259525.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,2.5313e+10,23.7044,446184,3578,68,522021,952,1100,3.22407e+06,77,3896,0
Converting to forward existential form...Done !
original formula: (AX(E(AG(A((i4.i2.u14.p75==1) U (i10.i0.u5.p22==1))) U EX(AG((i5.u45.p223==1))))) + E(!(((((i8.i2.u63.p294==1)&&(i11.u93.p415==1)) + A(((...263
=> equivalent forward existential formula: [(EY((Init * !(E(!(((((i8.i2.u63.p294==1)&&(i11.u93.p415==1)) + !((E(!((i4.i2.u15.p85==1)) U (!(((i2.u3.p12==1)&...473
Reverse transition relation is NOT exact ! Due to transitions t59, t66, t151, t190, t191, t193, t202, t211, t219, t224, t229, t234, t239, t243, t249, t250,...1238
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 306 transition count 559
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 306 transition count 559
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 293 transition count 501
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 293 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 293 transition count 499
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 288 transition count 489
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 288 transition count 489
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 286 transition count 484
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 286 transition count 484
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 284 transition count 479
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 284 transition count 479
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 282 transition count 474
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 282 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 280 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 278 transition count 464
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 278 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 276 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 276 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 274 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 274 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 272 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 272 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 270 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 270 transition count 444
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 268 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 268 transition count 440
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 266 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 266 transition count 436
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 264 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 264 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 263 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 263 transition count 432
Applied a total of 140 rules in 46 ms. Remains 263 /332 variables (removed 69) and now considering 432/607 (removed 175) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8164290173494461921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8608676626298563419.kers'
[2026-05-27 00:22:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8164290173494461921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8608676626298563419.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 263 cols 1312 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-27 00:22:57] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8608676626298563419.kers
Total runtime 4 ms.
[2026-05-27 00:22:57] [INFO ] Implicit Places using invariants in 298 ms returned []
[2026-05-27 00:22:57] [INFO ] Invariant cache hit.
[2026-05-27 00:22:57] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2026-05-27 00:22:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (OVERLAPS) 432/695 variables, 263/279 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 695/695 variables, and 279 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/695 variables, 263/279 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 431/710 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/695 variables, and 713 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 263/332 places, 432/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60979 ms. Remains : 263/332 places, 432/607 transitions.
[2026-05-27 00:23:57] [INFO ] Flatten gal took : 7 ms
[2026-05-27 00:23:57] [INFO ] Flatten gal took : 9 ms
[2026-05-27 00:23:57] [INFO ] Input system was already deterministic with 432 transitions.
[2026-05-27 00:23:57] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:23:57] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:23:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8820877666867061478.gal : 2 ms
[2026-05-27 00:23:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7124909176034502028.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/CTLFireability8820877666867061478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7124909176034502028.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.
Detected timeout of ITS tools.
[2026-05-27 00:24:28] [INFO ] Flatten gal took : 8 ms
[2026-05-27 00:24:28] [INFO ] Applying decomposition
[2026-05-27 00:24:28] [INFO ] Flatten gal took : 24 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/graph14109964158545187517.txt' '-o' '/tmp/graph14109964158545187517.bin' '-w' '/tmp/graph14109964158545187517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14109964158545187517.bin' '-l' '-1' '-v' '-w' '/tmp/graph14109964158545187517.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:24:28] [INFO ] Decomposing Gal with order
[2026-05-27 00:24:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:24:28] [INFO ] Removed a total of 449 redundant transitions.
[2026-05-27 00:24:28] [INFO ] Flatten gal took : 17 ms
[2026-05-27 00:24:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2026-05-27 00:24:28] [INFO ] Time to serialize gal into /tmp/CTLFireability8346996147745368168.gal : 3 ms
[2026-05-27 00:24:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17195041342226595732.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/CTLFireability8346996147745368168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17195041342226595732.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,2.43326e+10,8.55074,181512,1841,96,245829,909,928,961576,102,3420,0
Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t56, t63, t147, t185, t186, t188, t197, t199, t206, t211, t212, t214, t223, t242, t243, t245,...1065
(forward)formula 0,1,10.1001,181512,1,0,245829,1033,4536,961576,442,3741,356936
FORMULA FireWire-PT-18-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 607/607 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 310 transition count 583
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 310 transition count 583
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 301 transition count 550
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 301 transition count 550
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 297 transition count 543
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 297 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 296 transition count 540
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 296 transition count 540
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 295 transition count 538
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 295 transition count 538
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 294 transition count 535
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 294 transition count 535
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 293 transition count 533
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 293 transition count 533
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 292 transition count 530
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 292 transition count 530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 291 transition count 528
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 291 transition count 528
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 290 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 290 transition count 525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 289 transition count 523
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 289 transition count 523
Applied a total of 86 rules in 33 ms. Remains 289 /332 variables (removed 43) and now considering 523/607 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1526143753675277459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1012893954659060636.kers'
[2026-05-27 00:24:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1526143753675277459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1012893954659060636.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 523 rows 289 cols 1660 entries
Finished phase 1 with 282 SingleSign rule and 0 generalized
[2026-05-27 00:24:38] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1012893954659060636.kers
Total runtime 6 ms.
[2026-05-27 00:24:38] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-27 00:24:38] [INFO ] Invariant cache hit.
[2026-05-27 00:24:39] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2026-05-27 00:24:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/812 variables, and 17 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/812 variables, and 28 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 289/332 places, 523/607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60974 ms. Remains : 289/332 places, 523/607 transitions.
[2026-05-27 00:25:39] [INFO ] Flatten gal took : 15 ms
[2026-05-27 00:25:39] [INFO ] Flatten gal took : 16 ms
[2026-05-27 00:25:39] [INFO ] Input system was already deterministic with 523 transitions.
[2026-05-27 00:25:39] [INFO ] Flatten gal took : 18 ms
[2026-05-27 00:25:39] [INFO ] Flatten gal took : 17 ms
[2026-05-27 00:25:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16832742838698392888.gal : 3 ms
[2026-05-27 00:25:39] [INFO ] Time to serialize properties into /tmp/CTLFireability15701212883258173633.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/CTLFireability16832742838698392888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15701212883258173633.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.
Detected timeout of ITS tools.
[2026-05-27 00:26:09] [INFO ] Flatten gal took : 10 ms
[2026-05-27 00:26:09] [INFO ] Applying decomposition
[2026-05-27 00:26:09] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4151048743055621210.txt' '-o' '/tmp/graph4151048743055621210.bin' '-w' '/tmp/graph4151048743055621210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4151048743055621210.bin' '-l' '-1' '-v' '-w' '/tmp/graph4151048743055621210.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:26:09] [INFO ] Decomposing Gal with order
[2026-05-27 00:26:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:26:09] [INFO ] Removed a total of 607 redundant transitions.
[2026-05-27 00:26:09] [INFO ] Flatten gal took : 32 ms
[2026-05-27 00:26:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 5 ms.
[2026-05-27 00:26:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3778334674589829122.gal : 4 ms
[2026-05-27 00:26:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7777282929207419984.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/CTLFireability3778334674589829122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7777282929207419984.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-27 00:26:39] [INFO ] Flatten gal took : 13 ms
[2026-05-27 00:26:39] [INFO ] Flatten gal took : 14 ms
[2026-05-27 00:26:39] [INFO ] Applying decomposition
[2026-05-27 00:26:39] [INFO ] Flatten gal took : 23 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/graph2019217323194458331.txt' '-o' '/tmp/graph2019217323194458331.bin' '-w' '/tmp/graph2019217323194458331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2019217323194458331.bin' '-l' '-1' '-v' '-w' '/tmp/graph2019217323194458331.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:26:39] [INFO ] Decomposing Gal with order
[2026-05-27 00:26:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:26:39] [INFO ] Removed a total of 687 redundant transitions.
[2026-05-27 00:26:39] [INFO ] Flatten gal took : 26 ms
[2026-05-27 00:26:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 6 ms.
[2026-05-27 00:26:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16953497109657583500.gal : 5 ms
[2026-05-27 00:26:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14530143398754559322.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/CTLFireability16953497109657583500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14530143398754559322.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 14 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.20528e+10,197.1,2616852,4479,170,2.3426e+06,5122,1320,2.45982e+07,114,20583,0
Converting to forward existential form...Done !
original formula: (E(((!(AF(((i5.i1.u64.p154==1)&&(i8.i1.u75.p295==1)))) + ((i2.i1.u4.p19==1)&&(i0.u110.p418==1))) + (((i0.u10.p41==1)&&(i5.i1.u64.p247==1)...434
=> equivalent forward existential formula: (([FwdG((Init * !(E(((!(!(EG(!(((i5.i1.u64.p154==1)&&(i8.i1.u75.p295==1)))))) + ((i2.i1.u4.p19==1)&&(i0.u110.p41...1029
Reverse transition relation is NOT exact ! Due to transitions t32, t69, t76, t121, t178, t221, t226, t235, t244, t249, t250, t252, t257, t262, t267, t272, ...1502
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
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
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
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
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
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
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
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 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 a local 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,954.764,4320976,1,0,5.53294e+06,5446,3953,2.69269e+07,298,24357,7240711
FORMULA FireWire-PT-18-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A((E((((i0.u2.p12==1)&&(i0.u110.p419==1)) + EG(((i0.u2.p12==1)&&(i9.i1.u78.p395==1)))) U ((((i0.u3.p14==1)&&(i9.i1.u90.p343==1))&&(i5.i1....708
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U EX(!(EG(!((i10.i1.u98.p368==1)))))) + (!(E(TRUE U !(((EX(((i8.i1.u75.p294==1)&&(i11.u...1693
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
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
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 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 a local 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 1,1,1393.48,5322140,1,0,7.28836e+06,5738,3022,2.69269e+07,243,27931,2364572
FORMULA FireWire-PT-18-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-18"
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-18, 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-177955809000282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 execution
cd execution
if [ "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 ;