About the Execution of ITS-Tools for PermAdmissibility-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16209.428 | 3600000.00 | 5652299.00 | 482302.50 | TTFFF?FTFT?FTF?F | 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.r194-tall-177969914200627.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 PermAdmissibility-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200627
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 14K Mar 8 07:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 8 07:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 64K Mar 8 07:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 331K Mar 8 07:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Mar 16 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 16 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 16 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 16 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 8 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Mar 8 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 155K Mar 8 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 781K Mar 8 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Mar 16 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 340K 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 PermAdmissibility-PT-10-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779800230209
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 12:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 12:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 12:57:11] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2026-05-26 12:57:11] [INFO ] Transformed 168 places.
[2026-05-26 12:57:11] [INFO ] Transformed 592 transitions.
[2026-05-26 12:57:11] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-PT-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 132 transition count 592
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 127 transition count 512
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 127 transition count 512
Applied a total of 46 rules in 33 ms. Remains 127 /168 variables (removed 41) and now considering 512/592 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11235345517165913356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3177936915705336898.kers'
[2026-05-26 12:57:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11235345517165913356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3177936915705336898.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 512 rows 127 cols 2790 entries
Finished phase 1 with 59 SingleSign rule and 49 generalized
[2026-05-26 12:57:11] [INFO ] Computed 19 invariants in 4 ms
Computed 19 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3177936915705336898.kers
Total runtime 6 ms.
[2026-05-26 12:57:12] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-26 12:57:12] [INFO ] Invariant cache hit.
[2026-05-26 12:57:12] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 508 sub problems to find dead transitions.
[2026-05-26 12:57:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (OVERLAPS) 25/123 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (OVERLAPS) 512/635 variables, 123/142 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 508 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/639 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 8 (OVERLAPS) 0/639 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 508 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 146 constraints, problems are : Problem set: 0 solved, 508 unsolved in 18807 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (OVERLAPS) 25/123 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (OVERLAPS) 512/635 variables, 123/153 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 332/485 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/639 variables, and 485 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 123/127 constraints, PredecessorRefiner: 332/508 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49496ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 49512ms
Starting structural reductions in LTL mode, iteration 1 : 127/168 places, 512/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50146 ms. Remains : 127/168 places, 512/592 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2026-05-26 12:58:01] [INFO ] Invariant cache hit.
[2026-05-26 12:58:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-26 12:58:01] [INFO ] Invariant cache hit.
[2026-05-26 12:58:02] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 127/127 places, 512/512 transitions.
Support contains 102 out of 127 places after structural reductions.
[2026-05-26 12:58:02] [INFO ] Flatten gal took : 93 ms
[2026-05-26 12:58:02] [INFO ] Flatten gal took : 47 ms
[2026-05-26 12:58:02] [INFO ] Input system was already deterministic with 512 transitions.
Support contains 101 out of 127 places (down from 102) after GAL structural reductions.
RANDOM walk for 40015 steps (224 resets) in 665 ms. (60 steps per ms) remains 1/34 properties
BEST_FIRST walk for 40004 steps (11 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
[2026-05-26 12:58:02] [INFO ] Invariant cache hit.
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 2/639 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Generalized P Invariants (flows): 0/19 constraints, State Equation: 0/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 127 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 127 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((F(p0)||X(G(p1)))))'
Support contains 9 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 49 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 70 place count 78 transition count 344
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 89 place count 59 transition count 138
Iterating global reduction 1 with 19 rules applied. Total rules applied 108 place count 59 transition count 138
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 57 transition count 122
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 57 transition count 122
Applied a total of 112 rules in 14 ms. Remains 57 /127 variables (removed 70) and now considering 122/512 (removed 390) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13965236760032764653.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6567820106448498761.kers'
[2026-05-26 12:58:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13965236760032764653.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6567820106448498761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 57 cols 658 entries
Finished phase 1 with 14 SingleSign rule and 27 generalized
[2026-05-26 12:58:03] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6567820106448498761.kers
Total runtime 1 ms.
[2026-05-26 12:58:03] [INFO ] Implicit Places using invariants in 73 ms returned [0, 5, 19, 30]
[2026-05-26 12:58:03] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/127 places, 122/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 54/127 places, 122/512 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((F(p0)||X(G(p1)))))'
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Computed a total of 54 stabilizing places and 122 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 122
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 12 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 118 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-10-LTLCardinality-00 finished in 933 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 U X(p1))) U (p2 U X(p3)))))'
Support contains 18 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 107 transition count 512
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 99 transition count 468
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 99 transition count 468
Applied a total of 36 rules in 17 ms. Remains 99 /127 variables (removed 28) and now considering 468/512 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4941290220932624143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2565798050020972852.kers'
[2026-05-26 12:58:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4941290220932624143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2565798050020972852.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 99 cols 2432 entries
Finished phase 1 with 27 SingleSign rule and 55 generalized
[2026-05-26 12:58:04] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2565798050020972852.kers
Total runtime 3 ms.
[2026-05-26 12:58:04] [INFO ] Implicit Places using invariants in 110 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/127 places, 468/512 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 98/127 places, 468/512 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 U X(p1))) U (p2 U X(p3)))))'
Stuttering acceptance computed with spot in 484 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 20099 reset in 324 ms.
Product exploration explored 100000 steps with 20045 reset in 238 ms.
Computed a total of 98 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 15 factoid took 329 ms. Reduced automaton from 12 states, 21 edges and 4 AP (stutter sensitive) to 12 states, 20 edges and 4 AP (stutter sensitive).
RANDOM walk for 40018 steps (224 resets) in 661 ms. (60 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13921591289976614924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5141501868684709365.kers'
[2026-05-26 12:58:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13921591289976614924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5141501868684709365.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 98 cols 2364 entries
Finished phase 1 with 46 SingleSign rule and 36 generalized
[2026-05-26 12:58:06] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5141501868684709365.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/98 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 468/566 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 98/98 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
Problem apf2 is UNSAT
After SMT solving in domain Int declared 9/566 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Generalized P Invariants (flows): 0/16 constraints, State Equation: 0/98 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 16 factoid took 3500 ms. Reduced automaton from 12 states, 20 edges and 4 AP (stutter sensitive) to 12 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 518 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
[2026-05-26 12:58:10] [INFO ] Invariant cache hit.
[2026-05-26 12:58:10] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 18 ms returned unsat
Proved EG (NOT p3) asserting that LTL formula F !(NOT p3) is false.
Negative knowledge disproves property using: (F p3)
Knowledge-based reduction took 5054 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-02 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property PermAdmissibility-PT-10-LTLCardinality-02 finished in 6286 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 G(!p0)))'
Support contains 12 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Graph (complete) has 1120 edges and 127 vertex of which 50 are kept as prefixes of interest. Removing 77 places using SCC suffix rule.5 ms
Discarding 77 places :
Also discarding 304 output transitions
Drop transitions (Output transitions of discarded places.) removed 304 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 43 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 43 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 42 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 42 transition count 88
Applied a total of 17 rules in 21 ms. Remains 42 /127 variables (removed 85) and now considering 88/512 (removed 424) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5992775555925750952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7513743100120469845.kers'
[2026-05-26 12:58:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5992775555925750952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7513743100120469845.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 42 cols 419 entries
Finished phase 1 with 23 SingleSign rule and 9 generalized
[2026-05-26 12:58:10] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7513743100120469845.kers
Total runtime 1 ms.
[2026-05-26 12:58:10] [INFO ] Implicit Places using invariants in 51 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/127 places, 88/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 41/127 places, 88/512 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 G(!p0)))'
Stuttering acceptance computed with spot in 89 ms :[p0, true, p0]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-03 finished in 195 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((G((p0||X(F((p0&&X(F(!p0))))))) U X(X(p1)))))'
Support contains 18 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 107 transition count 512
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 100 transition count 400
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 100 transition count 400
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 44 place count 90 transition count 290
Iterating global reduction 1 with 10 rules applied. Total rules applied 54 place count 90 transition count 290
Applied a total of 54 rules in 15 ms. Remains 90 /127 variables (removed 37) and now considering 290/512 (removed 222) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11555352269686811347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1533955132345930585.kers'
[2026-05-26 12:58:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11555352269686811347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1533955132345930585.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 90 cols 1574 entries
Finished phase 1 with 41 SingleSign rule and 32 generalized
[2026-05-26 12:58:10] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1533955132345930585.kers
Total runtime 3 ms.
[2026-05-26 12:58:10] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-26 12:58:10] [INFO ] Invariant cache hit.
[2026-05-26 12:58:11] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-26 12:58:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 9/90 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 290/380 variables, 90/107 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 107 constraints, problems are : Problem set: 0 solved, 286 unsolved in 4223 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 9/90 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 290/380 variables, 90/107 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 286/393 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 393 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34428ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 34431ms
Starting structural reductions in LTL mode, iteration 1 : 90/127 places, 290/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34725 ms. Remains : 90/127 places, 290/512 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((G((p0||X(F((p0&&X(F(!p0))))))) U X(X(p1)))))'
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), true, p0, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-04
Stuttering criterion allowed to conclude after 604 steps with 16 reset in 8 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-04 finished in 35141 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||(F(p1)&&F(p2)))))'
Support contains 14 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 107 transition count 512
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 34 place count 93 transition count 372
Iterating global reduction 1 with 14 rules applied. Total rules applied 48 place count 93 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 83 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 83 transition count 262
Applied a total of 68 rules in 15 ms. Remains 83 /127 variables (removed 44) and now considering 262/512 (removed 250) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12743467808168300579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7829343224041454897.kers'
[2026-05-26 12:58:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12743467808168300579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7829343224041454897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 262 rows 83 cols 1406 entries
Finished phase 1 with 44 SingleSign rule and 22 generalized
[2026-05-26 12:58:45] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7829343224041454897.kers
Total runtime 1 ms.
[2026-05-26 12:58:46] [INFO ] Implicit Places using invariants in 94 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/127 places, 262/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 82/127 places, 262/512 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((p0||(F(p1)&&F(p2)))))'
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-05
Product exploration explored 100000 steps with 852 reset in 605 ms.
Product exploration explored 100000 steps with 846 reset in 614 ms.
Computed a total of 82 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 11 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 328 ms.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 262/262 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-380416912640329071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17950799530170978752.kers'
[2026-05-26 12:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-380416912640329071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17950799530170978752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 262 rows 82 cols 1338 entries
Finished phase 1 with 45 SingleSign rule and 21 generalized
[2026-05-26 12:58:47] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17950799530170978752.kers
Total runtime 2 ms.
[2026-05-26 12:58:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-26 12:58:48] [INFO ] Invariant cache hit.
[2026-05-26 12:58:48] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-26 12:58:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 9/82 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 262/344 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/344 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 98 constraints, problems are : Problem set: 0 solved, 258 unsolved in 4846 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 9/82 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 262/344 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 258/356 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/344 variables, and 356 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34971ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 34972ms
Finished structural reductions in LTL mode , in 1 iterations and 35211 ms. Remains : 82/82 places, 262/262 transitions.
Computed a total of 82 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 313 ms.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 838 reset in 563 ms.
Product exploration explored 100000 steps with 839 reset in 604 ms.
Spot run failed in 78 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/ltsmin5283928313385720375
[2026-05-26 12:59:25] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5283928313385720375
Running compilation step : cd /tmp/ltsmin5283928313385720375;'/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 571 ms.
Running link step : cd /tmp/ltsmin5283928313385720375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5283928313385720375;'/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/stateBased861718632679795927.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 262/262 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 74 transition count 262
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 67 transition count 234
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 67 transition count 234
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 36 place count 53 transition count 108
Iterating global reduction 1 with 14 rules applied. Total rules applied 50 place count 53 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 52 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 52 transition count 100
Applied a total of 52 rules in 7 ms. Remains 52 /82 variables (removed 30) and now considering 100/262 (removed 162) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16167603322426239499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7845121203469012025.kers'
[2026-05-26 12:59:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16167603322426239499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7845121203469012025.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 52 cols 526 entries
Finished phase 1 with 14 SingleSign rule and 23 generalized
[2026-05-26 12:59:39] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7845121203469012025.kers
Total runtime 0 ms.
[2026-05-26 12:59:40] [INFO ] Implicit Places using invariants in 53 ms returned [0, 17, 24]
[2026-05-26 12:59:40] [INFO ] Actually due to overlaps returned [0, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/82 places, 100/262 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 50/82 places, 100/262 transitions.
Built C files in :
/tmp/ltsmin15823588313281627979
[2026-05-26 12:59:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15823588313281627979
Running compilation step : cd /tmp/ltsmin15823588313281627979;'/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 209 ms.
Running link step : cd /tmp/ltsmin15823588313281627979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15823588313281627979;'/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/stateBased15044021040384336436.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 12:59:55] [INFO ] Flatten gal took : 9 ms
[2026-05-26 12:59:55] [INFO ] Flatten gal took : 12 ms
[2026-05-26 12:59:55] [INFO ] Time to serialize gal into /tmp/LTL5516248408735683071.gal : 11 ms
[2026-05-26 12:59:55] [INFO ] Time to serialize properties into /tmp/LTL16297203938338229898.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5516248408735683071.gal' '-t' 'CGAL' '-hoa' '/tmp/aut851376270384011348.hoa' '-atoms' '/tmp/LTL16297203938338229898.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL16297203938338229898.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut851376270384011348.hoa
Detected timeout of ITS tools.
[2026-05-26 13:00:10] [INFO ] Flatten gal took : 14 ms
[2026-05-26 13:00:10] [INFO ] Flatten gal took : 13 ms
[2026-05-26 13:00:10] [INFO ] Time to serialize gal into /tmp/LTL2812417907010622687.gal : 3 ms
[2026-05-26 13:00:10] [INFO ] Time to serialize properties into /tmp/LTL10636132993620060961.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2812417907010622687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10636132993620060961.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(c15>=1)")||((F("(((aux5_1+aux5_0)+(aux5_5+aux5_4))<2)"))&&(F("(c110<=(((out7_1+out7_0)+(out7_3+out7_2))+((out7_5+out7_4)+(out7...175
Formula 0 simplified : X(!"(c15>=1)" & (G!"(((aux5_1+aux5_0)+(aux5_5+aux5_4))<2)" | G!"(c110<=(((out7_1+out7_0)+(out7_3+out7_2))+((out7_5+out7_4)+(out7_7+o...167
Detected timeout of ITS tools.
[2026-05-26 13:00:25] [INFO ] Flatten gal took : 14 ms
[2026-05-26 13:00:25] [INFO ] Applying decomposition
[2026-05-26 13:00:25] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph606265532489722941.txt' '-o' '/tmp/graph606265532489722941.bin' '-w' '/tmp/graph606265532489722941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph606265532489722941.bin' '-l' '-1' '-v' '-w' '/tmp/graph606265532489722941.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:00:25] [INFO ] Decomposing Gal with order
[2026-05-26 13:00:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:00:25] [INFO ] Removed a total of 203 redundant transitions.
[2026-05-26 13:00:25] [INFO ] Flatten gal took : 85 ms
[2026-05-26 13:00:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 6 ms.
[2026-05-26 13:00:25] [INFO ] Time to serialize gal into /tmp/LTL7448235504101467861.gal : 3 ms
[2026-05-26 13:00:25] [INFO ] Time to serialize properties into /tmp/LTL1257826395152266601.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7448235504101467861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1257826395152266601.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(gi1.gu5.c15>=1)")||((F("(((gu3.aux5_1+gu3.aux5_0)+(gu3.aux5_5+gu3.aux5_4))<2)"))&&(F("(gu1.c110<=(((gu1.out7_1+gu1.out7_0)+(gu...235
Formula 0 simplified : X(!"(gi1.gu5.c15>=1)" & (G!"(((gu3.aux5_1+gu3.aux5_0)+(gu3.aux5_5+gu3.aux5_4))<2)" | G!"(gu1.c110<=(((gu1.out7_1+gu1.out7_0)+(gu1.ou...227
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-05 finished in 114804 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||G(p1)))))'
Support contains 15 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Graph (complete) has 1120 edges and 127 vertex of which 81 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.5 ms
Discarding 46 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 63 transition count 230
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 63 transition count 230
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 46 place count 54 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 55 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 57 place count 52 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 52 transition count 92
Applied a total of 59 rules in 16 ms. Remains 52 /127 variables (removed 75) and now considering 92/512 (removed 420) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6119395569771834873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15249956827181726514.kers'
[2026-05-26 13:00:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6119395569771834873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15249956827181726514.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 52 cols 488 entries
Finished phase 1 with 21 SingleSign rule and 17 generalized
[2026-05-26 13:00:40] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15249956827181726514.kers
Total runtime 1 ms.
[2026-05-26 13:00:40] [INFO ] Implicit Places using invariants in 64 ms returned [0, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/127 places, 92/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 50/127 places, 92/512 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-06
Stuttering criterion allowed to conclude after 2497 steps with 22 reset in 16 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-06 finished in 213 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(X(F(p1)))))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 49 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 70 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 94 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 118 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 51 transition count 84
Applied a total of 124 rules in 5 ms. Remains 51 /127 variables (removed 76) and now considering 84/512 (removed 428) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10564419353055369379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14803029225010881792.kers'
[2026-05-26 13:00:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10564419353055369379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14803029225010881792.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 51 cols 446 entries
Finished phase 1 with 14 SingleSign rule and 21 generalized
[2026-05-26 13:00:41] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14803029225010881792.kers
Total runtime 0 ms.
[2026-05-26 13:00:41] [INFO ] Implicit Places using invariants in 121 ms returned [0, 5, 18, 25]
[2026-05-26 13:00:41] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 123 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/127 places, 84/512 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 48/127 places, 84/512 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(X(F(p1)))))))'
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Product exploration explored 100000 steps with 25000 reset in 129 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 35729 steps (200 resets) in 65 ms. (541 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 385 ms.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5238441969871247781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14143720690100388973.kers'
[2026-05-26 13:00:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5238441969871247781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14143720690100388973.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 48 cols 422 entries
Finished phase 1 with 21 SingleSign rule and 14 generalized
[2026-05-26 13:00:42] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14143720690100388973.kers
Total runtime 1 ms.
[2026-05-26 13:00:42] [INFO ] Implicit Places using invariants in 49 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/48 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 47/48 places, 84/84 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 44 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 32007 steps (179 resets) in 56 ms. (561 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 355 ms.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 116 ms.
Product exploration explored 100000 steps with 25000 reset in 117 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/ltsmin16324497110470462312
[2026-05-26 13:00:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16324497110470462312
Running compilation step : cd /tmp/ltsmin16324497110470462312;'/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 187 ms.
Running link step : cd /tmp/ltsmin16324497110470462312;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16324497110470462312;'/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/stateBased6080857360304346093.hoa' '--buchi-type=spotba'
LTSmin run took 25 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-10-LTLCardinality-07 finished in 2446 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(X(F(p0))))&&(F(p1) U G(p2))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 100 transition count 512
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 47 place count 80 transition count 348
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 88 place count 59 transition count 124
Iterating global reduction 1 with 21 rules applied. Total rules applied 109 place count 59 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 57 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 57 transition count 108
Applied a total of 113 rules in 10 ms. Remains 57 /127 variables (removed 70) and now considering 108/512 (removed 404) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4803506431493272174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13780468698536760061.kers'
[2026-05-26 13:00:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4803506431493272174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13780468698536760061.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 108 rows 57 cols 576 entries
Finished phase 1 with 19 SingleSign rule and 22 generalized
[2026-05-26 13:00:43] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13780468698536760061.kers
Total runtime 2 ms.
[2026-05-26 13:00:43] [INFO ] Implicit Places using invariants in 56 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/127 places, 108/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 56/127 places, 108/512 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(F(p0))))&&(F(p1) U G(p2))))'
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-08
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-08 finished in 406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))&&F(p2)))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 99 transition count 512
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 79 transition count 348
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 79 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 89 place count 58 transition count 122
Iterating global reduction 1 with 21 rules applied. Total rules applied 110 place count 58 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 57 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 57 transition count 114
Applied a total of 112 rules in 8 ms. Remains 57 /127 variables (removed 70) and now considering 114/512 (removed 398) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5469575949881795953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2152098987103329730.kers'
[2026-05-26 13:00:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5469575949881795953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2152098987103329730.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 57 cols 610 entries
Finished phase 1 with 24 SingleSign rule and 17 generalized
[2026-05-26 13:00:43] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2152098987103329730.kers
Total runtime 1 ms.
[2026-05-26 13:00:43] [INFO ] Implicit Places using invariants in 65 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/127 places, 114/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 56/127 places, 114/512 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))&&F(p2)))'
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 56 stabilizing places and 114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 10 ms. Proved property starting from automaton with 6 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 59 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-10-LTLCardinality-09 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)||X(F(p2)))) U G(p3)))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Graph (complete) has 1120 edges and 127 vertex of which 99 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 79 transition count 346
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 79 transition count 346
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 63 place count 57 transition count 124
Iterating global reduction 0 with 22 rules applied. Total rules applied 85 place count 57 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 86 place count 56 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 87 place count 56 transition count 116
Applied a total of 87 rules in 18 ms. Remains 56 /127 variables (removed 71) and now considering 116/512 (removed 396) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11743451277966420876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10714546921001507168.kers'
[2026-05-26 13:00:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11743451277966420876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10714546921001507168.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 56 cols 621 entries
Finished phase 1 with 16 SingleSign rule and 24 generalized
[2026-05-26 13:00:44] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10714546921001507168.kers
Total runtime 2 ms.
[2026-05-26 13:00:44] [INFO ] Implicit Places using invariants in 58 ms returned [0, 6, 20, 28]
[2026-05-26 13:00:44] [INFO ] Actually due to overlaps returned [0, 6, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/127 places, 116/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 53/127 places, 116/512 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)||X(F(p2)))) U G(p3)))'
Stuttering acceptance computed with spot in 273 ms :[(NOT p3), (NOT p2), (AND (NOT p2) p3 (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p2) p0 (NOT p1) (NOT p3))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-10
Product exploration explored 100000 steps with 34967 reset in 162 ms.
Product exploration explored 100000 steps with 35124 reset in 219 ms.
Computed a total of 53 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 33 factoid took 655 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
RANDOM walk for 40005 steps (224 resets) in 68 ms. (579 steps per ms) remains 1/16 properties
BEST_FIRST walk for 4656 steps (0 resets) in 25 ms. (179 steps per ms) remains 0/1 properties
Knowledge based reduction with 33 factoid took 2209 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p3), (NOT p2), (AND (NOT p2) p3 (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p2) p0 (NOT p1) (NOT p3))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7809136709585916891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18359742356927141673.kers'
[2026-05-26 13:00:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7809136709585916891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18359742356927141673.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 53 cols 591 entries
Finished phase 1 with 25 SingleSign rule and 15 generalized
[2026-05-26 13:00:48] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18359742356927141673.kers
Total runtime 1 ms.
[2026-05-26 13:00:48] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2026-05-26 13:00:48] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-26 13:00:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 13:00:48] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-26 13:00:48] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-26 13:00:48] [INFO ] Computed and/alt/rep : 24/147/24 causal constraints (skipped 88 transitions) in 13 ms.
[2026-05-26 13:00:48] [INFO ] Added : 14 causal constraints over 6 iterations in 95 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 3499 ms.
Stuttering acceptance computed with spot in 218 ms :[(NOT p3), (NOT p2), (AND (NOT p2) p3 (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p2) p0 (NOT p1) (NOT p3))]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 53 /53 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2026-05-26 13:00:48] [INFO ] Invariant cache hit.
[2026-05-26 13:00:48] [INFO ] Implicit Places using invariants in 47 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/53 places, 116/116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 114
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 4 place count 50 transition count 114
Applied a total of 4 rules in 11 ms. Remains 50 /52 variables (removed 2) and now considering 114/116 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12191909760953956034.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4890815853155139346.kers'
[2026-05-26 13:00:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12191909760953956034.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4890815853155139346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 50 cols 573 entries
Finished phase 1 with 25 SingleSign rule and 13 generalized
[2026-05-26 13:00:49] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4890815853155139346.kers
Total runtime 0 ms.
[2026-05-26 13:00:49] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-26 13:00:49] [INFO ] Invariant cache hit.
[2026-05-26 13:00:49] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/53 places, 114/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199 ms. Remains : 50/53 places, 114/116 transitions.
Computed a total of 50 stabilizing places and 114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 33 factoid took 354 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
RANDOM walk for 40015 steps (255 resets) in 215 ms. (185 steps per ms) remains 0/16 properties
Knowledge based reduction with 33 factoid took 976 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p3), (NOT p2), (AND (NOT p2) p3 (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p2) p0 (NOT p1) (NOT p3))]
[2026-05-26 13:00:50] [INFO ] Invariant cache hit.
[2026-05-26 13:00:50] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 5 ms returned sat
[2026-05-26 13:00:50] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-26 13:00:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 13:00:51] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2026-05-26 13:00:51] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2026-05-26 13:00:51] [INFO ] Computed and/alt/rep : 23/139/23 causal constraints (skipped 87 transitions) in 12 ms.
[2026-05-26 13:00:51] [INFO ] Added : 14 causal constraints over 4 iterations in 65 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 1989 ms.
Stuttering acceptance computed with spot in 295 ms :[(NOT p3), (NOT p2), (AND (NOT p2) p3 (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p2) p0 (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 281 ms :[(NOT p3), (NOT p2), (AND (NOT p2) p3 (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p2) p0 (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 35042 reset in 157 ms.
Product exploration explored 100000 steps with 35021 reset in 162 ms.
Built C files in :
/tmp/ltsmin17756213106778215033
[2026-05-26 13:00:52] [INFO ] Computing symmetric may disable matrix : 114 transitions.
[2026-05-26 13:00:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:00:52] [INFO ] Computing symmetric may enable matrix : 114 transitions.
[2026-05-26 13:00:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:00:52] [INFO ] Computing Do-Not-Accords matrix : 114 transitions.
[2026-05-26 13:00:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:00:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17756213106778215033
Running compilation step : cd /tmp/ltsmin17756213106778215033;'/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 268 ms.
Running link step : cd /tmp/ltsmin17756213106778215033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17756213106778215033;'/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/stateBased7286361559480574366.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 114/114 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2026-05-26 13:01:07] [INFO ] Invariant cache hit.
[2026-05-26 13:01:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-26 13:01:07] [INFO ] Invariant cache hit.
[2026-05-26 13:01:07] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2026-05-26 13:01:07] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-26 13:01:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 114/164 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/164 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 62 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1310 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 114/164 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 110/172 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 172 constraints, problems are : Problem set: 0 solved, 110 unsolved in 16308 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17652ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 17653ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17821 ms. Remains : 50/50 places, 114/114 transitions.
Built C files in :
/tmp/ltsmin13963466134894277109
[2026-05-26 13:01:24] [INFO ] Computing symmetric may disable matrix : 114 transitions.
[2026-05-26 13:01:24] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:01:24] [INFO ] Computing symmetric may enable matrix : 114 transitions.
[2026-05-26 13:01:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:01:24] [INFO ] Computing Do-Not-Accords matrix : 114 transitions.
[2026-05-26 13:01:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:01:24] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13963466134894277109
Running compilation step : cd /tmp/ltsmin13963466134894277109;'/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 262 ms.
Running link step : cd /tmp/ltsmin13963466134894277109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13963466134894277109;'/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/stateBased988510289774222282.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 13:01:39] [INFO ] Flatten gal took : 8 ms
[2026-05-26 13:01:39] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:01:39] [INFO ] Time to serialize gal into /tmp/LTL12702228354782549854.gal : 2 ms
[2026-05-26 13:01:39] [INFO ] Time to serialize properties into /tmp/LTL12579256409651513939.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12702228354782549854.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11306526604433388295.hoa' '-atoms' '/tmp/LTL12579256409651513939.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12579256409651513939.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11306526604433388295.hoa
Detected timeout of ITS tools.
[2026-05-26 13:01:55] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:01:55] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:01:55] [INFO ] Time to serialize gal into /tmp/LTL9718467417390249582.gal : 2 ms
[2026-05-26 13:01:55] [INFO ] Time to serialize properties into /tmp/LTL7386914540116419041.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9718467417390249582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7386914540116419041.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G((("(aux5_0<1)")||(G("(c12<3)")))||(X(F("(aux8_6<2)")))))U(G("(aux14_2>=1)"))))
Formula 0 simplified : F(!"(aux5_0<1)" & F!"(c12<3)" & XG!"(aux8_6<2)") R F!"(aux14_2>=1)"
Detected timeout of ITS tools.
[2026-05-26 13:02:10] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:02:10] [INFO ] Applying decomposition
[2026-05-26 13:02:10] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9349934696754085073.txt' '-o' '/tmp/graph9349934696754085073.bin' '-w' '/tmp/graph9349934696754085073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9349934696754085073.bin' '-l' '-1' '-v' '-w' '/tmp/graph9349934696754085073.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:02:10] [INFO ] Decomposing Gal with order
[2026-05-26 13:02:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:02:10] [INFO ] Removed a total of 68 redundant transitions.
[2026-05-26 13:02:10] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:02:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 2 ms.
[2026-05-26 13:02:10] [INFO ] Time to serialize gal into /tmp/LTL3402192110658971297.gal : 2 ms
[2026-05-26 13:02:10] [INFO ] Time to serialize properties into /tmp/LTL10080695388000541101.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3402192110658971297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10080695388000541101.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G((("(i1.u2.aux5_0<1)")||(G("(u1.c12<3)")))||(X(F("(u1.aux8_6<2)")))))U(G("(i2.u3.aux14_2>=1)"))))
Formula 0 simplified : F(!"(i1.u2.aux5_0<1)" & F!"(u1.c12<3)" & XG!"(u1.aux8_6<2)") R F!"(i2.u3.aux14_2>=1)"
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-10 finished in 100769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 49 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 70 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 94 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 118 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 51 transition count 84
Applied a total of 124 rules in 6 ms. Remains 51 /127 variables (removed 76) and now considering 84/512 (removed 428) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8776691845010850804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12603496785259135817.kers'
[2026-05-26 13:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8776691845010850804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12603496785259135817.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 51 cols 446 entries
Finished phase 1 with 14 SingleSign rule and 21 generalized
[2026-05-26 13:02:25] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12603496785259135817.kers
Total runtime 1 ms.
[2026-05-26 13:02:25] [INFO ] Implicit Places using invariants in 54 ms returned [0, 5, 18, 25]
[2026-05-26 13:02:25] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/127 places, 84/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 48/127 places, 84/512 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-11 finished in 197 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(X(p0))||G(p1))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 99 transition count 512
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 79 transition count 348
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 79 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 90 place count 57 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 112 place count 57 transition count 118
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 54 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 54 transition count 94
Applied a total of 118 rules in 7 ms. Remains 54 /127 variables (removed 73) and now considering 94/512 (removed 418) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14444566791500965777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2209802234158360709.kers'
[2026-05-26 13:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14444566791500965777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2209802234158360709.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 54 cols 498 entries
Finished phase 1 with 18 SingleSign rule and 20 generalized
[2026-05-26 13:02:25] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2209802234158360709.kers
Total runtime 2 ms.
[2026-05-26 13:02:25] [INFO ] Implicit Places using invariants in 49 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/127 places, 94/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 53/127 places, 94/512 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))||G(p1))))'
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Computed a total of 53 stabilizing places and 94 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 94
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 5 factoid took 67 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 4546 steps (23 resets) in 9 ms. (454 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 390 ms.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4812622962694071565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9698662091440709769.kers'
[2026-05-26 13:02:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4812622962694071565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9698662091440709769.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 53 cols 490 entries
Finished phase 1 with 18 SingleSign rule and 20 generalized
[2026-05-26 13:02:26] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9698662091440709769.kers
Total runtime 2 ms.
[2026-05-26 13:02:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-26 13:02:26] [INFO ] Invariant cache hit.
[2026-05-26 13:02:26] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-26 13:02:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 94/147 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 68 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1655 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 94/147 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 90/158 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 158 constraints, problems are : Problem set: 0 solved, 90 unsolved in 10563 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12243ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 12243ms
Finished structural reductions in LTL mode , in 1 iterations and 12389 ms. Remains : 53/53 places, 94/94 transitions.
Computed a total of 53 stabilizing places and 94 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 94
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 4884 steps (25 resets) in 9 ms. (488 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 348 ms.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 109 ms.
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Spot run failed in 51 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/ltsmin14585856765696467644
[2026-05-26 13:02:40] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14585856765696467644
Running compilation step : cd /tmp/ltsmin14585856765696467644;'/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 203 ms.
Running link step : cd /tmp/ltsmin14585856765696467644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14585856765696467644;'/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/stateBased13689501647792662040.hoa' '--buchi-type=spotba'
LTSmin run took 14 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-10-LTLCardinality-12 finished in 14907 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(G((p0||X(G(!p0))))))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 101 transition count 512
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 45 place count 82 transition count 352
Iterating global reduction 1 with 19 rules applied. Total rules applied 64 place count 82 transition count 352
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 84 place count 62 transition count 136
Iterating global reduction 1 with 20 rules applied. Total rules applied 104 place count 62 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 61 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 61 transition count 128
Applied a total of 106 rules in 5 ms. Remains 61 /127 variables (removed 66) and now considering 128/512 (removed 384) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9614972147766830000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2014646198328880233.kers'
[2026-05-26 13:02:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9614972147766830000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2014646198328880233.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 61 cols 688 entries
Finished phase 1 with 22 SingleSign rule and 23 generalized
[2026-05-26 13:02:40] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2014646198328880233.kers
Total runtime 2 ms.
[2026-05-26 13:02:40] [INFO ] Implicit Places using invariants in 65 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/127 places, 128/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 60/127 places, 128/512 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((p0&&X(G((p0||X(G(!p0))))))))'
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), p0, (NOT p0), false]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-13 finished in 269 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&&(p1||(p1 U X(p2)))))))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 512/512 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 102 transition count 512
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 42 place count 85 transition count 356
Iterating global reduction 1 with 17 rules applied. Total rules applied 59 place count 85 transition count 356
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 75 place count 69 transition count 180
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 69 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 68 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 68 transition count 172
Applied a total of 93 rules in 5 ms. Remains 68 /127 variables (removed 59) and now considering 172/512 (removed 340) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12533980540841024989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10463811567310842470.kers'
[2026-05-26 13:02:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12533980540841024989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10463811567310842470.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 68 cols 938 entries
Finished phase 1 with 32 SingleSign rule and 20 generalized
[2026-05-26 13:02:40] [INFO ] Computed 16 invariants in 3 ms
Computed 16 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10463811567310842470.kers
Total runtime 4 ms.
[2026-05-26 13:02:40] [INFO ] Implicit Places using invariants in 68 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/127 places, 172/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 67/127 places, 172/512 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&&(p1||(p1 U X(p2)))))))'
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 621 reset in 433 ms.
Product exploration explored 100000 steps with 621 reset in 453 ms.
Computed a total of 67 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 22 factoid took 85 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
RANDOM walk for 40025 steps (224 resets) in 52 ms. (755 steps per ms) remains 0/8 properties
Knowledge based reduction with 22 factoid took 235 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Knowledge-based reduction took 472 ms.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-408190467539783926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1771320015444346045.kers'
[2026-05-26 13:02:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-408190467539783926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1771320015444346045.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 67 cols 926 entries
Finished phase 1 with 28 SingleSign rule and 24 generalized
[2026-05-26 13:02:42] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1771320015444346045.kers
Total runtime 1 ms.
[2026-05-26 13:02:42] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-26 13:02:42] [INFO ] Invariant cache hit.
[2026-05-26 13:02:42] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2026-05-26 13:02:42] [INFO ] Redundant transitions in 4 ms returned []
Running 168 sub problems to find dead transitions.
[2026-05-26 13:02:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 172/236 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 3/239 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/239 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 82 constraints, problems are : Problem set: 0 solved, 168 unsolved in 2483 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 172/236 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 151/230 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 168 unsolved
SMT process timed out in 32562ms, After SMT, problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 32564ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32783 ms. Remains : 67/67 places, 172/172 transitions.
Computed a total of 67 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 20 factoid took 74 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
RANDOM walk for 40016 steps (224 resets) in 65 ms. (606 steps per ms) remains 1/8 properties
BEST_FIRST walk for 11465 steps (1 resets) in 18 ms. (603 steps per ms) remains 0/1 properties
Knowledge based reduction with 20 factoid took 267 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Knowledge-based reduction took 503 ms.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 621 reset in 442 ms.
Product exploration explored 100000 steps with 621 reset in 459 ms.
Built C files in :
/tmp/ltsmin3178269951254090651
[2026-05-26 13:03:16] [INFO ] Computing symmetric may disable matrix : 172 transitions.
[2026-05-26 13:03:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:03:16] [INFO ] Computing symmetric may enable matrix : 172 transitions.
[2026-05-26 13:03:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:03:16] [INFO ] Computing Do-Not-Accords matrix : 172 transitions.
[2026-05-26 13:03:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:03:16] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3178269951254090651
Running compilation step : cd /tmp/ltsmin3178269951254090651;'/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 385 ms.
Running link step : cd /tmp/ltsmin3178269951254090651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3178269951254090651;'/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/stateBased10303319470844215418.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2026-05-26 13:03:31] [INFO ] Invariant cache hit.
[2026-05-26 13:03:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-26 13:03:31] [INFO ] Invariant cache hit.
[2026-05-26 13:03:31] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2026-05-26 13:03:31] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 67/67 places, 172/172 transitions.
Built C files in :
/tmp/ltsmin17925339788041384328
[2026-05-26 13:03:31] [INFO ] Computing symmetric may disable matrix : 172 transitions.
[2026-05-26 13:03:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:03:31] [INFO ] Computing symmetric may enable matrix : 172 transitions.
[2026-05-26 13:03:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:03:31] [INFO ] Computing Do-Not-Accords matrix : 172 transitions.
[2026-05-26 13:03:31] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:03:31] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17925339788041384328
Running compilation step : cd /tmp/ltsmin17925339788041384328;'/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 348 ms.
Running link step : cd /tmp/ltsmin17925339788041384328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17925339788041384328;'/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/stateBased13400413210534374998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 13:03:46] [INFO ] Flatten gal took : 8 ms
[2026-05-26 13:03:46] [INFO ] Flatten gal took : 8 ms
[2026-05-26 13:03:46] [INFO ] Time to serialize gal into /tmp/LTL2315040078655234027.gal : 1 ms
[2026-05-26 13:03:46] [INFO ] Time to serialize properties into /tmp/LTL12464730606277349726.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2315040078655234027.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15807046412496355914.hoa' '-atoms' '/tmp/LTL12464730606277349726.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12464730606277349726.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15807046412496355914.hoa
Detected timeout of ITS tools.
[2026-05-26 13:04:01] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:04:01] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:04:01] [INFO ] Time to serialize gal into /tmp/LTL6854836627067926284.gal : 2 ms
[2026-05-26 13:04:01] [INFO ] Time to serialize properties into /tmp/LTL8821585407323492719.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6854836627067926284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8821585407323492719.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((out1_3<3)||(out2_5<=aux14_6))||(c17<=in1_0))")&&(("(out8_3<=c17)")||(("(out8_3<=c17)")U(X("(c17<=in1_0)"))))))))
Formula 0 simplified : GF(!"(((out1_3<3)||(out2_5<=aux14_6))||(c17<=in1_0))" | (!"(out8_3<=c17)" & (!"(out8_3<=c17)" R X!"(c17<=in1_0)")))
Detected timeout of ITS tools.
[2026-05-26 13:04:16] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:04:16] [INFO ] Applying decomposition
[2026-05-26 13:04:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4070708472037377950.txt' '-o' '/tmp/graph4070708472037377950.bin' '-w' '/tmp/graph4070708472037377950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4070708472037377950.bin' '-l' '-1' '-v' '-w' '/tmp/graph4070708472037377950.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:04:17] [INFO ] Decomposing Gal with order
[2026-05-26 13:04:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:04:17] [INFO ] Removed a total of 101 redundant transitions.
[2026-05-26 13:04:17] [INFO ] Flatten gal took : 15 ms
[2026-05-26 13:04:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 2 ms.
[2026-05-26 13:04:17] [INFO ] Time to serialize gal into /tmp/LTL9665282783338377625.gal : 2 ms
[2026-05-26 13:04:17] [INFO ] Time to serialize properties into /tmp/LTL1657417719059779905.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9665282783338377625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1657417719059779905.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((gi2.gu0.out1_3<3)||(gu2.out2_5<=gu2.aux14_6))||(gu1.c17<=gu1.in1_0))")&&(("(gu1.out8_3<=gu1.c17)")||(("(gu1.out8_3<=gu1.c1...193
Formula 0 simplified : GF(!"(((gi2.gu0.out1_3<3)||(gu2.out2_5<=gu2.aux14_6))||(gu1.c17<=gu1.in1_0))" | (!"(gu1.out8_3<=gu1.c17)" & (!"(gu1.out8_3<=gu1.c17)...186
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-14 finished in 111555 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||(F(p1)&&F(p2)))))'
Spot run failed in 43 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)||X(F(p2)))) U G(p3)))'
Spot run failed in 35 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||(p1 U X(p2)))))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 13:04:32] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3913343802271095819
[2026-05-26 13:04:32] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2026-05-26 13:04:32] [INFO ] Applying decomposition
[2026-05-26 13:04:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:04:32] [INFO ] Flatten gal took : 14 ms
[2026-05-26 13:04:32] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2026-05-26 13:04:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph874634086855173276.txt' '-o' '/tmp/graph874634086855173276.bin' '-w' '/tmp/graph874634086855173276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph874634086855173276.bin' '-l' '-1' '-v' '-w' '/tmp/graph874634086855173276.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:04:32] [INFO ] Decomposing Gal with order
[2026-05-26 13:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:04:32] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2026-05-26 13:04:32] [INFO ] Removed a total of 795 redundant transitions.
[2026-05-26 13:04:32] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:04:32] [INFO ] Flatten gal took : 89 ms
[2026-05-26 13:04:32] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3913343802271095819
Running compilation step : cd /tmp/ltsmin3913343802271095819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 13:04:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 394 labels/synchronizations in 54 ms.
[2026-05-26 13:04:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality5529014649427774459.gal : 3 ms
[2026-05-26 13:04:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality8535563821638869666.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5529014649427774459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8535563821638869666.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((X(("(gi3.gi1.gu4.c15>=1)")||((F("(((gu5.aux5_1+gu5.aux5_0)+(gu5.aux5_5+gu5.aux5_4))<2)"))&&(F("(gu2.c110<=(((gu2.out7_1+gu2.out7_0)...239
Formula 0 simplified : X(!"(gi3.gi1.gu4.c15>=1)" & (G!"(((gu5.aux5_1+gu5.aux5_0)+(gu5.aux5_5+gu5.aux5_4))<2)" | G!"(gu2.c110<=(((gu2.out7_1+gu2.out7_0)+(gu...231
Compilation finished in 1320 ms.
Running link step : cd /tmp/ltsmin3913343802271095819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3913343802271095819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((LTLAPp0==true)||(<>((LTLAPp1==true))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin3913343802271095819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((LTLAPp0==true)||(<>((LTLAPp1==true))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3913343802271095819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](((LTLAPp3==true)||[]((LTLAPp4==true))||X(<>((LTLAPp5==true))))) U []((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin3913343802271095819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](((LTLAPp3==true)||[]((LTLAPp4==true))||X(<>((LTLAPp5==true))))) U []((LTLAPp6==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3913343802271095819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>([](((LTLAPp7==true)&&((LTLAPp8==true)||((LTLAPp8==true) U X((LTLAPp9==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin3913343802271095819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>([](((LTLAPp7==true)&&((LTLAPp8==true)||((LTLAPp8==true) U X((LTLAPp9==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin3913343802271095819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((LTLAPp0==true)||(<>((LTLAPp1==true))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 13:27:15] [INFO ] Flatten gal took : 319 ms
[2026-05-26 13:27:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality14180949736563780839.gal : 57 ms
[2026-05-26 13:27:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality6079484223231231892.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14180949736563780839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6079484223231231892.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((X(("(c15>=1)")||((F("(((aux5_1+aux5_0)+(aux5_5+aux5_4))<2)"))&&(F("(c110<=(((out7_1+out7_0)+(out7_3+out7_2))+((out7_5+out7_4)+(out7...175
Formula 0 simplified : X(!"(c15>=1)" & (G!"(((aux5_1+aux5_0)+(aux5_5+aux5_4))<2)" | G!"(c110<=(((out7_1+out7_0)+(out7_3+out7_2))+((out7_5+out7_4)+(out7_7+o...167
Detected timeout of ITS tools.
[2026-05-26 13:50:01] [INFO ] Flatten gal took : 446 ms
[2026-05-26 13:50:03] [INFO ] Input system was already deterministic with 512 transitions.
[2026-05-26 13:50:03] [INFO ] Transformed 127 places.
[2026-05-26 13:50:03] [INFO ] Transformed 512 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-26 13:50:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality13546589642833331758.gal : 8 ms
[2026-05-26 13:50:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality15520605603408885458.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13546589642833331758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15520605603408885458.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("(c15>=1)")||((F("(((aux5_1+aux5_0)+(aux5_5+aux5_4))<2)"))&&(F("(c110<=(((out7_1+out7_0)+(out7_3+out7_2))+((out7_5+out7_4)+(out7...175
Formula 0 simplified : X(!"(c15>=1)" & (G!"(((aux5_1+aux5_0)+(aux5_5+aux5_4))<2)" | G!"(c110<=(((out7_1+out7_0)+(out7_3+out7_2))+((out7_5+out7_4)+(out7_7+o...167
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914200627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-10.tgz
mv PermAdmissibility-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;