About the Execution of ITS-Tools for GPUForwardProgress-PT-24b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 727.640 | 541544.00 | 648902.00 | 6128.50 | FTFFFFFFTFFFFFFF | 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.r146-tall-177961074200468.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 GPUForwardProgress-PT-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.8K Mar 7 11:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 11:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 11:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 11:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 122K 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 GPUForwardProgress-PT-24b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779729051502
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 17:10:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 17:10:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:10:52] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2026-05-25 17:10:52] [INFO ] Transformed 492 places.
[2026-05-25 17:10:52] [INFO ] Transformed 517 transitions.
[2026-05-25 17:10:52] [INFO ] Found NUPN structural information;
[2026-05-25 17:10:52] [INFO ] Parsed PT model containing 492 places and 517 transitions and 1277 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 517/517 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 491 transition count 517
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 51 place count 441 transition count 467
Iterating global reduction 1 with 50 rules applied. Total rules applied 101 place count 441 transition count 467
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 124 place count 418 transition count 444
Iterating global reduction 1 with 23 rules applied. Total rules applied 147 place count 418 transition count 444
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 168 place count 418 transition count 423
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 417 transition count 422
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 417 transition count 422
Applied a total of 170 rules in 123 ms. Remains 417 /492 variables (removed 75) and now considering 422/517 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-110078138502323577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4098153403779615494.kers'
[2026-05-25 17:10:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-110078138502323577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4098153403779615494.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 422 rows 417 cols 1085 entries
Finished phase 1 with 391 SingleSign rule and 1 generalized
[2026-05-25 17:10:53] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4098153403779615494.kers
Total runtime 4 ms.
[2026-05-25 17:10:53] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-25 17:10:53] [INFO ] Invariant cache hit.
[2026-05-25 17:10:53] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2026-05-25 17:10:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 422/838 variables, 416/441 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/838 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 1/839 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 839/839 variables, and 442 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 422/838 variables, 416/441 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/838 variables, 421/862 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/838 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (OVERLAPS) 1/839 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 839/839 variables, and 863 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in LTL mode, iteration 1 : 417/492 places, 422/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60925 ms. Remains : 417/492 places, 422/517 transitions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Applied a total of 0 rules in 11 ms. Remains 417 /417 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2026-05-25 17:11:53] [INFO ] Invariant cache hit.
[2026-05-25 17:11:53] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 17:11:53] [INFO ] Invariant cache hit.
[2026-05-25 17:11:54] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 417/417 places, 422/422 transitions.
Support contains 30 out of 417 places after structural reductions.
[2026-05-25 17:11:54] [INFO ] Flatten gal took : 46 ms
[2026-05-25 17:11:54] [INFO ] Flatten gal took : 21 ms
[2026-05-25 17:11:54] [INFO ] Input system was already deterministic with 422 transitions.
RANDOM walk for 40000 steps (190 resets) in 1771 ms. (22 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40003 steps (18 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (22 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
[2026-05-25 17:11:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 102/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 308/416 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 422/838 variables, 416/441 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/839 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/839 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/839 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 442 constraints, problems are : Problem set: 0 solved, 5 unsolved in 355 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 102/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 308/416 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 422/838 variables, 416/441 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 5/446 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/839 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 447 constraints, problems are : Problem set: 0 solved, 5 unsolved in 716 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1075ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 145 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=145 )
Parikh walk visited 5 properties in 45 ms.
Computed a total of 79 stabilizing places and 79 stable transitions
Graph (complete) has 647 edges and 417 vertex of which 389 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(X(X(p2))||p1))))))'
Support contains 3 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 411 transition count 416
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 411 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 411 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 410 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 410 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 410 transition count 413
Applied a total of 16 rules in 28 ms. Remains 410 /417 variables (removed 7) and now considering 413/422 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12850807057592640353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-329335893996791263.kers'
[2026-05-25 17:11:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12850807057592640353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-329335893996791263.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 410 cols 1067 entries
Finished phase 1 with 384 SingleSign rule and 1 generalized
[2026-05-25 17:11:56] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-329335893996791263.kers
Total runtime 6 ms.
[2026-05-25 17:11:56] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 17:11:56] [INFO ] Invariant cache hit.
[2026-05-25 17:11:57] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 17:11:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 410/417 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60491 ms. Remains : 410/417 places, 413/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(X(X(p2))||p1))))))'
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 148 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-02 finished in 60916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(X(p1))) U X((p2&&X(p3))))))'
Support contains 6 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 411 transition count 416
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 411 transition count 416
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 409 transition count 414
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 409 transition count 414
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 409 transition count 412
Applied a total of 18 rules in 34 ms. Remains 409 /417 variables (removed 8) and now considering 412/422 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9187356857928346136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-484284115755436565.kers'
[2026-05-25 17:12:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9187356857928346136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-484284115755436565.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 412 rows 409 cols 1065 entries
Finished phase 1 with 383 SingleSign rule and 1 generalized
[2026-05-25 17:12:57] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-484284115755436565.kers
Total runtime 3 ms.
[2026-05-25 17:12:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 17:12:57] [INFO ] Invariant cache hit.
[2026-05-25 17:12:57] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2026-05-25 17:12:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 412/820 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (OVERLAPS) 1/821 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 821/821 variables, and 434 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 412/820 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 411/844 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (OVERLAPS) 1/821 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/821 variables, and 845 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 409/417 places, 412/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60409 ms. Remains : 409/417 places, 412/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(p0))||p1) U X((p2&&X(p3))))))'
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p3) (NOT p0)), true]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-03 finished in 60796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 417 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Graph (trivial) has 342 edges and 417 vertex of which 6 / 417 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 641 edges and 412 vertex of which 384 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 200 place count 383 transition count 214
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 204 rules applied. Total rules applied 404 place count 185 transition count 208
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 408 place count 183 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 410 place count 181 transition count 206
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 410 place count 181 transition count 155
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 512 place count 130 transition count 155
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 536 place count 106 transition count 131
Iterating global reduction 4 with 24 rules applied. Total rules applied 560 place count 106 transition count 131
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 704 place count 34 transition count 59
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 725 place count 13 transition count 17
Iterating global reduction 4 with 21 rules applied. Total rules applied 746 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 748 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 749 place count 11 transition count 15
Applied a total of 749 rules in 51 ms. Remains 11 /417 variables (removed 406) and now considering 15/422 (removed 407) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17221740135279171543.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14962584005882095994.kers'
[2026-05-25 17:13:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17221740135279171543.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14962584005882095994.kers]
Normalized transition count is 14 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 11 cols 34 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 17:13:58] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14962584005882095994.kers
Total runtime 0 ms.
[2026-05-25 17:13:58] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-25 17:13:58] [INFO ] Invariant cache hit.
[2026-05-25 17:13:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:13:58] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2026-05-25 17:13:58] [INFO ] Redundant transitions in 13 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-25 17:13:58] [INFO ] Invariant cache hit.
[2026-05-25 17:13:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/25 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 106 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 128 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 238ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 240ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/417 places, 15/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 11/417 places, 15/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-04 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U (p1||X(F(p2))))))'
Support contains 3 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 410 transition count 415
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 410 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 410 transition count 414
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 408 transition count 412
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 408 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 408 transition count 410
Applied a total of 21 rules in 46 ms. Remains 408 /417 variables (removed 9) and now considering 410/422 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14846653012410910704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10358570604108511903.kers'
[2026-05-25 17:13:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14846653012410910704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10358570604108511903.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 410 rows 408 cols 1061 entries
Finished phase 1 with 382 SingleSign rule and 1 generalized
[2026-05-25 17:13:58] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10358570604108511903.kers
Total runtime 2 ms.
[2026-05-25 17:13:59] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 17:13:59] [INFO ] Invariant cache hit.
[2026-05-25 17:13:59] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2026-05-25 17:13:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 408/417 places, 410/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60484 ms. Remains : 408/417 places, 410/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U (p1||X(F(p2))))))'
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-05
Product exploration explored 100000 steps with 626 reset in 206 ms.
Product exploration explored 100000 steps with 633 reset in 181 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.12 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Detected a total of 75/408 stabilizing places and 75/410 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 8 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
RANDOM walk for 35003 steps (167 resets) in 324 ms. (107 steps per ms) remains 0/6 properties
Knowledge based reduction with 8 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2026-05-25 17:15:01] [INFO ] Invariant cache hit.
[2026-05-25 17:15:01] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-25 17:15:02] [INFO ] [Real]Absence check using state equation in 941 ms returned sat
[2026-05-25 17:15:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:15:02] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 6 ms returned sat
[2026-05-25 17:15:03] [INFO ] [Nat]Absence check using state equation in 1329 ms returned sat
[2026-05-25 17:15:03] [INFO ] Computed and/alt/rep : 404/530/404 causal constraints (skipped 5 transitions) in 20 ms.
[2026-05-25 17:15:07] [INFO ] Added : 390 causal constraints over 78 iterations in 3486 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2026-05-25 17:15:07] [INFO ] Invariant cache hit.
[2026-05-25 17:15:07] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-25 17:15:07] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2026-05-25 17:15:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:15:07] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 6 ms returned sat
[2026-05-25 17:15:08] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2026-05-25 17:15:08] [INFO ] Computed and/alt/rep : 404/530/404 causal constraints (skipped 5 transitions) in 19 ms.
[2026-05-25 17:15:10] [INFO ] Added : 390 causal constraints over 78 iterations in 2866 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 10139 ms.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Applied a total of 0 rules in 20 ms. Remains 408 /408 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2026-05-25 17:15:11] [INFO ] Invariant cache hit.
[2026-05-25 17:15:11] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 17:15:11] [INFO ] Invariant cache hit.
[2026-05-25 17:15:11] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 360 ms. Remains : 408/408 places, 410/410 transitions.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.7 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Detected a total of 75/408 stabilizing places and 75/410 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 7 factoid took 58 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
RANDOM walk for 32038 steps (152 resets) in 143 ms. (222 steps per ms) remains 0/6 properties
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2026-05-25 17:15:11] [INFO ] Invariant cache hit.
[2026-05-25 17:15:11] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-25 17:15:12] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2026-05-25 17:15:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:15:13] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-25 17:15:14] [INFO ] [Nat]Absence check using state equation in 1358 ms returned sat
[2026-05-25 17:15:14] [INFO ] Computed and/alt/rep : 404/530/404 causal constraints (skipped 5 transitions) in 20 ms.
[2026-05-25 17:15:17] [INFO ] Added : 390 causal constraints over 78 iterations in 3338 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2026-05-25 17:15:17] [INFO ] Invariant cache hit.
[2026-05-25 17:15:17] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 8 ms returned sat
[2026-05-25 17:15:18] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2026-05-25 17:15:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:15:18] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-25 17:15:18] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2026-05-25 17:15:18] [INFO ] Computed and/alt/rep : 404/530/404 causal constraints (skipped 5 transitions) in 18 ms.
[2026-05-25 17:15:21] [INFO ] Added : 390 causal constraints over 78 iterations in 2808 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 9931 ms.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 624 reset in 146 ms.
Product exploration explored 100000 steps with 634 reset in 160 ms.
Spot run failed in 72 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin6374933665171487782
[2026-05-25 17:15:22] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6374933665171487782
Running compilation step : cd /tmp/ltsmin6374933665171487782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 696 ms.
Running link step : cd /tmp/ltsmin6374933665171487782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6374933665171487782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased439384269693979723.hoa' '--buchi-type=spotba'
LTSmin run took 93 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-05 finished in 84155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 410 transition count 415
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 410 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 410 transition count 414
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 408 transition count 412
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 408 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 408 transition count 410
Applied a total of 21 rules in 24 ms. Remains 408 /417 variables (removed 9) and now considering 410/422 (removed 12) transitions.
[2026-05-25 17:15:23] [INFO ] Invariant cache hit.
[2026-05-25 17:15:23] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 17:15:23] [INFO ] Invariant cache hit.
[2026-05-25 17:15:23] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 408/417 places, 410/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 408/417 places, 410/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3038 steps with 14 reset in 7 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-06 finished in 549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(p1))))))'
Support contains 2 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 411 transition count 416
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 411 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 411 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 410 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 410 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 410 transition count 413
Applied a total of 16 rules in 27 ms. Remains 410 /417 variables (removed 7) and now considering 413/422 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1025019925064516442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1375528962827864088.kers'
[2026-05-25 17:15:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1025019925064516442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1375528962827864088.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 410 cols 1067 entries
Finished phase 1 with 384 SingleSign rule and 1 generalized
[2026-05-25 17:15:23] [INFO ] Computed 25 invariants in 5 ms
Computed 25 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1375528962827864088.kers
Total runtime 6 ms.
[2026-05-25 17:15:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 17:15:23] [INFO ] Invariant cache hit.
[2026-05-25 17:15:23] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 17:15:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 410/417 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60460 ms. Remains : 410/417 places, 413/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(p1))))))'
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-07
Product exploration explored 100000 steps with 480 reset in 158 ms.
Product exploration explored 100000 steps with 480 reset in 185 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 638 edges and 410 vertex of which 382 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Detected a total of 75/410 stabilizing places and 75/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 16 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (192 resets) in 165 ms. (240 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (23 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (19 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (21 resets) in 100 ms. (396 steps per ms) remains 1/3 properties
[2026-05-25 17:16:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 352/409 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 352/409 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/823 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/823 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 436 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 427ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 413/413 transitions.
Graph (trivial) has 334 edges and 410 vertex of which 6 / 410 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 631 edges and 405 vertex of which 377 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 196 rules applied. Total rules applied 198 place count 377 transition count 207
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 392 place count 183 transition count 207
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 392 place count 183 transition count 157
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 492 place count 133 transition count 157
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 517 place count 108 transition count 132
Iterating global reduction 2 with 25 rules applied. Total rules applied 542 place count 108 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 542 place count 108 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 544 place count 107 transition count 131
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 690 place count 34 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 90 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 692 place count 33 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 694 place count 33 transition count 55
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 716 place count 11 transition count 11
Iterating global reduction 4 with 22 rules applied. Total rules applied 738 place count 11 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 743 place count 8 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 10 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 746 place count 7 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 747 place count 7 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 748 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 749 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 749 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 751 place count 4 transition count 4
Applied a total of 751 rules in 21 ms. Remains 4 /410 variables (removed 406) and now considering 4/413 (removed 409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 4/410 places, 4/413 transitions.
RANDOM walk for 3342 steps (1 resets) in 6 ms. (477 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 5 states, 16 edges and 2 AP (stutter insensitive) to 5 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false]
Knowledge-based reduction took 1014 ms.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 413/413 transitions.
Graph (trivial) has 334 edges and 410 vertex of which 6 / 410 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 632 edges and 405 vertex of which 377 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 195 place count 376 transition count 210
Reduce places removed 193 places and 0 transitions.
Iterating post reduction 1 with 193 rules applied. Total rules applied 388 place count 183 transition count 210
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 388 place count 183 transition count 159
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 490 place count 132 transition count 159
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 513 place count 109 transition count 136
Iterating global reduction 2 with 23 rules applied. Total rules applied 536 place count 109 transition count 136
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 682 place count 36 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 683 place count 36 transition count 62
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 706 place count 13 transition count 17
Iterating global reduction 3 with 23 rules applied. Total rules applied 729 place count 13 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 733 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 734 place count 10 transition count 15
Applied a total of 734 rules in 25 ms. Remains 10 /410 variables (removed 400) and now considering 15/413 (removed 398) transitions.
[2026-05-25 17:16:25] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17711690270870131754.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2238360328881840877.kers'
[2026-05-25 17:16:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17711690270870131754.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2238360328881840877.kers]
Normalized transition count is 13 out of 14 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 10 cols 30 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 17:16:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2238360328881840877.kers
Total runtime 0 ms.
[2026-05-25 17:16:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 17:16:25] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2026-05-25 17:16:25] [INFO ] Invariant cache hit.
[2026-05-25 17:16:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:16:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-25 17:16:25] [INFO ] Redundant transitions in 11 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-25 17:16:25] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2026-05-25 17:16:25] [INFO ] Invariant cache hit.
[2026-05-25 17:16:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 88 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 89 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/410 places, 15/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 10/410 places, 15/413 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Detected a total of 4/10 stabilizing places and 6/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 293 ms. Reduced automaton from 5 states, 16 edges and 2 AP (stutter insensitive) to 5 states, 16 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 286 steps (24 resets) in 7 ms. (35 steps per ms) remains 0/6 properties
Knowledge based reduction with 6 factoid took 393 ms. Reduced automaton from 5 states, 16 edges and 2 AP (stutter insensitive) to 5 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false]
Knowledge-based reduction took 858 ms.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-07 finished in 63716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(!p0)))))))'
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Graph (trivial) has 345 edges and 417 vertex of which 6 / 417 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 641 edges and 412 vertex of which 384 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 383 transition count 211
Reduce places removed 201 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 207 rules applied. Total rules applied 410 place count 182 transition count 205
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 412 place count 180 transition count 205
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 412 place count 180 transition count 153
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 516 place count 128 transition count 153
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 539 place count 105 transition count 130
Iterating global reduction 3 with 23 rules applied. Total rules applied 562 place count 105 transition count 130
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 710 place count 31 transition count 56
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 733 place count 8 transition count 10
Iterating global reduction 3 with 23 rules applied. Total rules applied 756 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 757 place count 7 transition count 9
Applied a total of 757 rules in 23 ms. Remains 7 /417 variables (removed 410) and now considering 9/422 (removed 413) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-618969290165248290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13583665078456850998.kers'
[2026-05-25 17:16:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-618969290165248290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13583665078456850998.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 16 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-25 17:16:27] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13583665078456850998.kers
Total runtime 0 ms.
[2026-05-25 17:16:27] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 17:16:27] [INFO ] Invariant cache hit.
[2026-05-25 17:16:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 17:16:27] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-25 17:16:27] [INFO ] Redundant transitions in 11 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-25 17:16:27] [INFO ] Invariant cache hit.
[2026-05-25 17:16:27] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/15 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 11 constraints, problems are : Problem set: 0 solved, 7 unsolved in 67 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/15 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/16 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 7 unsolved in 79 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/417 places, 9/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 7/417 places, 9/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(!p0)))))))'
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-08
Product exploration explored 100000 steps with 40035 reset in 51 ms.
Product exploration explored 100000 steps with 39951 reset in 120 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/7 stabilizing places and 6/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2026-05-25 17:16:28] [INFO ] Invariant cache hit.
[2026-05-25 17:16:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-25 17:16:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 17:16:28] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 17:16:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:16:28] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2026-05-25 17:16:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2026-05-25 17:16:28] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 17:16:28] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 287 ms.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2026-05-25 17:16:28] [INFO ] Invariant cache hit.
[2026-05-25 17:16:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-25 17:16:28] [INFO ] Invariant cache hit.
[2026-05-25 17:16:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 17:16:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-25 17:16:28] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 7/7 places, 9/9 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/7 stabilizing places and 6/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2026-05-25 17:16:28] [INFO ] Invariant cache hit.
[2026-05-25 17:16:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-25 17:16:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 17:16:28] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 17:16:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:16:28] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2026-05-25 17:16:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 17:16:28] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-25 17:16:28] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 291 ms.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39987 reset in 110 ms.
Product exploration explored 100000 steps with 40016 reset in 127 ms.
Built C files in :
/tmp/ltsmin2593933157078656989
[2026-05-25 17:16:28] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2026-05-25 17:16:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:16:28] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2026-05-25 17:16:28] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:16:28] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2026-05-25 17:16:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:16:28] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2593933157078656989
Running compilation step : cd /tmp/ltsmin2593933157078656989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin2593933157078656989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2593933157078656989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3875319351797003446.hoa' '--buchi-type=spotba'
LTSmin run took 20 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-08 finished in 1656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Graph (trivial) has 345 edges and 417 vertex of which 6 / 417 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 641 edges and 412 vertex of which 384 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 383 transition count 212
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 206 rules applied. Total rules applied 408 place count 183 transition count 206
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 411 place count 181 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 412 place count 180 transition count 205
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 412 place count 180 transition count 154
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 514 place count 129 transition count 154
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 538 place count 105 transition count 130
Iterating global reduction 4 with 24 rules applied. Total rules applied 562 place count 105 transition count 130
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 708 place count 32 transition count 57
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 730 place count 10 transition count 13
Iterating global reduction 4 with 22 rules applied. Total rules applied 752 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 754 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 755 place count 8 transition count 11
Applied a total of 755 rules in 25 ms. Remains 8 /417 variables (removed 409) and now considering 11/422 (removed 411) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-459344132583071976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1085879296684183794.kers'
[2026-05-25 17:16:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-459344132583071976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1085879296684183794.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 24 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 17:16:28] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1085879296684183794.kers
Total runtime 0 ms.
[2026-05-25 17:16:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 17:16:29] [INFO ] Invariant cache hit.
[2026-05-25 17:16:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:16:29] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-25 17:16:29] [INFO ] Redundant transitions in 12 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-25 17:16:29] [INFO ] Invariant cache hit.
[2026-05-25 17:16:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 70 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 83 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/417 places, 11/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 8/417 places, 11/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-09
Stuttering criterion allowed to conclude after 15 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-09 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0) U p1) U X(p2))||F(G((p0 U p1)))))'
Support contains 5 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 411 transition count 416
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 411 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 411 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 410 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 410 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 410 transition count 413
Applied a total of 16 rules in 27 ms. Remains 410 /417 variables (removed 7) and now considering 413/422 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17072258841721737524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9935601866953370119.kers'
[2026-05-25 17:16:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17072258841721737524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9935601866953370119.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 410 cols 1067 entries
Finished phase 1 with 384 SingleSign rule and 1 generalized
[2026-05-25 17:16:29] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9935601866953370119.kers
Total runtime 3 ms.
[2026-05-25 17:16:29] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 17:16:29] [INFO ] Invariant cache hit.
[2026-05-25 17:16:29] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 17:16:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 410/417 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60405 ms. Remains : 410/417 places, 413/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0) U p1) U X(p2))||F(G((p0 U p1)))))'
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-10
Product exploration explored 100000 steps with 2384 reset in 132 ms.
Product exploration explored 100000 steps with 2389 reset in 141 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 638 edges and 410 vertex of which 382 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Detected a total of 75/410 stabilizing places and 75/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 20 factoid took 91 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (190 resets) in 216 ms. (184 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40003 steps (25 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (23 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
[2026-05-25 17:17:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 315/409 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 3 unsolved in 263 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 315/409 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/823 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/823 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 438 constraints, problems are : Problem set: 0 solved, 3 unsolved in 621 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 890ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 313 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=62 )
Parikh walk visited 3 properties in 6 ms.
Knowledge based reduction with 20 factoid took 254 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2026-05-25 17:17:31] [INFO ] Invariant cache hit.
[2026-05-25 17:17:32] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-25 17:17:33] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2026-05-25 17:17:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:33] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-25 17:17:35] [INFO ] [Nat]Absence check using state equation in 1670 ms returned sat
[2026-05-25 17:17:35] [INFO ] Computed and/alt/rep : 407/535/407 causal constraints (skipped 5 transitions) in 19 ms.
[2026-05-25 17:17:39] [INFO ] Added : 379 causal constraints over 76 iterations in 4945 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 9710 ms.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 413/413 transitions.
Applied a total of 0 rules in 13 ms. Remains 410 /410 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2026-05-25 17:17:40] [INFO ] Invariant cache hit.
[2026-05-25 17:17:40] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 17:17:40] [INFO ] Invariant cache hit.
[2026-05-25 17:17:40] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 410/410 places, 413/413 transitions.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 638 edges and 410 vertex of which 382 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Detected a total of 75/410 stabilizing places and 75/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 19 factoid took 80 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
RANDOM walk for 30111 steps (140 resets) in 116 ms. (257 steps per ms) remains 0/10 properties
Knowledge based reduction with 19 factoid took 247 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2026-05-25 17:17:41] [INFO ] Invariant cache hit.
[2026-05-25 17:17:41] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 8 ms returned sat
[2026-05-25 17:17:42] [INFO ] [Real]Absence check using state equation in 1103 ms returned sat
[2026-05-25 17:17:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:42] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-25 17:17:44] [INFO ] [Nat]Absence check using state equation in 1656 ms returned sat
[2026-05-25 17:17:44] [INFO ] Computed and/alt/rep : 407/535/407 causal constraints (skipped 5 transitions) in 20 ms.
[2026-05-25 17:17:49] [INFO ] Added : 379 causal constraints over 76 iterations in 4972 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Knowledge-based reduction took 8731 ms.
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1610 reset in 134 ms.
Product exploration explored 100000 steps with 1621 reset in 146 ms.
Spot run failed in 45 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2834599826268925610
[2026-05-25 17:17:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2834599826268925610
Running compilation step : cd /tmp/ltsmin2834599826268925610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 572 ms.
Running link step : cd /tmp/ltsmin2834599826268925610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2834599826268925610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased1979674277233392155.hoa' '--buchi-type=spotba'
LTSmin run took 102 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-10 finished in 81768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Graph (trivial) has 345 edges and 417 vertex of which 6 / 417 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 641 edges and 412 vertex of which 384 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 383 transition count 210
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 208 rules applied. Total rules applied 412 place count 181 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 414 place count 179 transition count 204
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 414 place count 179 transition count 153
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 516 place count 128 transition count 153
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 540 place count 104 transition count 129
Iterating global reduction 3 with 24 rules applied. Total rules applied 564 place count 104 transition count 129
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 708 place count 32 transition count 57
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 730 place count 10 transition count 13
Iterating global reduction 3 with 22 rules applied. Total rules applied 752 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 754 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 755 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 756 place count 8 transition count 11
Applied a total of 756 rules in 23 ms. Remains 8 /417 variables (removed 409) and now considering 11/422 (removed 411) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7636536444890589468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11631027896780496470.kers'
[2026-05-25 17:17:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7636536444890589468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11631027896780496470.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 24 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 17:17:51] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11631027896780496470.kers
Total runtime 1 ms.
[2026-05-25 17:17:51] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 17:17:51] [INFO ] Invariant cache hit.
[2026-05-25 17:17:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:17:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-25 17:17:51] [INFO ] Redundant transitions in 10 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 17:17:51] [INFO ] Invariant cache hit.
[2026-05-25 17:17:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 76 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/417 places, 11/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 8/417 places, 11/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-11 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p1))))&&(G(F(p0)) U p2)))'
Support contains 3 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 411 transition count 416
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 411 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 411 transition count 415
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 409 transition count 413
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 409 transition count 411
Applied a total of 19 rules in 28 ms. Remains 409 /417 variables (removed 8) and now considering 411/422 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4439574116258042399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14790049804913746341.kers'
[2026-05-25 17:17:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4439574116258042399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14790049804913746341.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 411 rows 409 cols 1063 entries
Finished phase 1 with 383 SingleSign rule and 1 generalized
[2026-05-25 17:17:51] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14790049804913746341.kers
Total runtime 4 ms.
[2026-05-25 17:17:51] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 17:17:51] [INFO ] Invariant cache hit.
[2026-05-25 17:17:51] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2026-05-25 17:17:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (OVERLAPS) 1/820 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/820 variables, and 434 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30010 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 410/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (OVERLAPS) 1/820 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/820 variables, and 844 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 409/417 places, 411/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60422 ms. Remains : 409/417 places, 411/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p1))))&&(G(F(p0)) U p2)))'
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-12
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-12 finished in 60763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X((G(p2) U (p3&&G(p2))))))'
Support contains 6 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 422/422 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 411 transition count 416
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 411 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 411 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 410 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 410 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 410 transition count 413
Applied a total of 16 rules in 28 ms. Remains 410 /417 variables (removed 7) and now considering 413/422 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17579675139288890660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17119829226583549957.kers'
[2026-05-25 17:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17579675139288890660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17119829226583549957.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 410 cols 1067 entries
Finished phase 1 with 384 SingleSign rule and 1 generalized
[2026-05-25 17:18:52] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17119829226583549957.kers
Total runtime 5 ms.
[2026-05-25 17:18:52] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 17:18:52] [INFO ] Invariant cache hit.
[2026-05-25 17:18:52] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-25 17:18:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 410/417 places, 413/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60404 ms. Remains : 410/417 places, 413/422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X((G(p2) U (p3&&G(p2))))))'
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-15
Stuttering criterion allowed to conclude after 214 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-15 finished in 60874 ms.
All properties solved by simple procedures.
Total runtime 540413 ms.
BK_STOP 1779729593046
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-24b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-24b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074200468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-24b.tgz
mv GPUForwardProgress-PT-24b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;