About the Execution of ITS-Tools for LamportFastMutEx-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6422.628 | 1363416.00 | 2067854.00 | 5047.30 | TFTFFFFFFFFFFTFT | 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.r162-smll-177961107900380.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 LamportFastMutEx-COL-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107900380
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 5.9K Mar 7 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 7 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Mar 15 11:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 11:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 7 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 16:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 7 16:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 11:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 43K 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 LamportFastMutEx-COL-7-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779858772976
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-27 05:12:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 05:12:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 05:12:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-27 05:12:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-27 05:12:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 868 ms
[2026-05-27 05:12:55] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2026-05-27 05:12:56] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 7 ms.
[2026-05-27 05:12:56] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-COL-7-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 31044 steps (7 resets) in 313 ms. (98 steps per ms) remains 0/16 properties
[2026-05-27 05:12:56] [INFO ] Flatten gal took : 23 ms
[2026-05-27 05:12:56] [INFO ] Flatten gal took : 5 ms
Domain [pid(8), pid(8)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2026-05-27 05:12:56] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 52 ms.
[2026-05-27 05:12:56] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
Support contains 212 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 14 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2026-05-27 05:12:56] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-946190341479578756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5002449794040670783.kers'
[2026-05-27 05:12:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-946190341479578756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5002449794040670783.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 336 rows 212 cols 1092 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:12:56] [INFO ] Computed 65 invariants in 2 ms
Computed 65 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5002449794040670783.kers
Total runtime 4 ms.
[2026-05-27 05:12:57] [INFO ] Implicit Places using invariants in 367 ms returned []
[2026-05-27 05:12:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2026-05-27 05:12:57] [INFO ] Invariant cache hit.
[2026-05-27 05:12:57] [INFO ] State equation strengthened by 91 read => feed constraints.
[2026-05-27 05:12:57] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2026-05-27 05:12:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2026-05-27 05:12:57] [INFO ] Invariant cache hit.
[2026-05-27 05:12:57] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 22 solved, 433 unsolved
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 41 solved, 414 unsolved
Problem TDEAD203 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 42 solved, 413 unsolved
SMT process timed out in 30474ms, After SMT, problems are : Problem set: 42 solved, 413 unsolved
Search for dead transitions found 42 dead transitions in 30500ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LTL mode, iteration 1 : 219/219 places, 420/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31433 ms. Remains : 219/219 places, 420/462 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:13:28] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9770382647034737770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10611146151159856283.kers'
[2026-05-27 05:13:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9770382647034737770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10611146151159856283.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 212 cols 1036 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:13:28] [INFO ] Computed 65 invariants in 1 ms
Computed 65 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10611146151159856283.kers
Total runtime 2 ms.
[2026-05-27 05:13:28] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-27 05:13:28] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:13:28] [INFO ] Invariant cache hit.
[2026-05-27 05:13:28] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-27 05:13:28] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-27 05:13:28] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:13:28] [INFO ] Invariant cache hit.
[2026-05-27 05:13:28] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
SMT process timed out in 30267ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 30270ms
Finished structural reductions in LTL mode , in 1 iterations and 30613 ms. Remains : 219/219 places, 420/420 transitions.
Support contains 212 out of 219 places after structural reductions.
[2026-05-27 05:13:58] [INFO ] Flatten gal took : 70 ms
[2026-05-27 05:13:59] [INFO ] Flatten gal took : 73 ms
[2026-05-27 05:13:59] [INFO ] Input system was already deterministic with 420 transitions.
Reduction of identical properties reduced properties to check from 25 to 20
RANDOM walk for 3745 steps (0 resets) in 238 ms. (15 steps per ms) remains 0/20 properties
FORMULA LamportFastMutEx-COL-7-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA LamportFastMutEx-COL-7-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 7 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((X((p1||X(p1)))&&F(p2))))))'
Support contains 36 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 14 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:14:00] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:14:00] [INFO ] Invariant cache hit.
[2026-05-27 05:14:00] [INFO ] Implicit Places using invariants in 318 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 325 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 14 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 368 ms. Remains : 212/219 places, 420/420 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((X((p1||X(p1)))&&F(p2))))))'
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 599 ms.
Product exploration explored 100000 steps with 33333 reset in 425 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 16 ms. Proved property starting from automaton with 6 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-7-LTLFireability-00 finished in 1956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Applied a total of 14 rules in 55 ms. Remains 212 /219 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2026-05-27 05:14:01] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1674507962549414437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17010633981434481531.kers'
[2026-05-27 05:14:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1674507962549414437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17010633981434481531.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 301 rows 205 cols 1022 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-27 05:14:01] [INFO ] Computed 65 invariants in 1 ms
Computed 65 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17010633981434481531.kers
Total runtime 3 ms.
[2026-05-27 05:14:02] [INFO ] Implicit Places using invariants in 317 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 319 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 413/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 406
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 406
Applied a total of 14 rules in 33 ms. Remains 198 /205 variables (removed 7) and now considering 406/413 (removed 7) transitions.
[2026-05-27 05:14:02] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18102226532728776947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-255501742431031450.kers'
[2026-05-27 05:14:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18102226532728776947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-255501742431031450.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 191 cols 1036 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 05:14:02] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-255501742431031450.kers
Total runtime 2 ms.
[2026-05-27 05:14:02] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-27 05:14:02] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:14:02] [INFO ] Invariant cache hit.
[2026-05-27 05:14:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:14:03] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 406/420 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1190 ms. Remains : 198/219 places, 406/420 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-01
Product exploration explored 100000 steps with 3857 reset in 728 ms.
Product exploration explored 100000 steps with 3864 reset in 682 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 34 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 203 ms.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 22 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 22 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-27 05:14:04] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:14:04] [INFO ] Invariant cache hit.
[2026-05-27 05:14:05] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-27 05:14:05] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:14:05] [INFO ] Invariant cache hit.
[2026-05-27 05:14:05] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:14:05] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2026-05-27 05:14:05] [INFO ] Redundant transitions in 33 ms returned []
Running 399 sub problems to find dead transitions.
[2026-05-27 05:14:05] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:14:05] [INFO ] Invariant cache hit.
[2026-05-27 05:14:05] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 7/198 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/492 variables, and 160 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/198 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 102/102 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 80/89 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 7/198 variables, 49/138 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 22/160 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 10 (OVERLAPS) 294/492 variables, 198/388 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 35/423 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 399/822 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 822 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 132/132 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60929 ms. Remains : 198/198 places, 406/406 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 199 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3960 reset in 598 ms.
Product exploration explored 100000 steps with 3799 reset in 567 ms.
Built C files in :
/tmp/ltsmin4907126013551421626
[2026-05-27 05:15:07] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2026-05-27 05:15:07] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:15:07] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2026-05-27 05:15:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:15:07] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2026-05-27 05:15:07] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:15:07] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4907126013551421626
Running compilation step : cd /tmp/ltsmin4907126013551421626;'/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 1608 ms.
Running link step : cd /tmp/ltsmin4907126013551421626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin4907126013551421626;'/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/stateBased4590012813791529883.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 22 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 17 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-27 05:15:22] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:15:22] [INFO ] Invariant cache hit.
[2026-05-27 05:15:22] [INFO ] Implicit Places using invariants in 269 ms returned []
[2026-05-27 05:15:22] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:15:22] [INFO ] Invariant cache hit.
[2026-05-27 05:15:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:15:23] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2026-05-27 05:15:23] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 983 ms. Remains : 198/198 places, 406/406 transitions.
Built C files in :
/tmp/ltsmin8759020516705878155
[2026-05-27 05:15:23] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2026-05-27 05:15:23] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:15:23] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2026-05-27 05:15:23] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:15:23] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2026-05-27 05:15:23] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:15:23] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8759020516705878155
Running compilation step : cd /tmp/ltsmin8759020516705878155;'/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 1589 ms.
Running link step : cd /tmp/ltsmin8759020516705878155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin8759020516705878155;'/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/stateBased2583167940038404947.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 05:15:38] [INFO ] Flatten gal took : 39 ms
[2026-05-27 05:15:38] [INFO ] Flatten gal took : 40 ms
[2026-05-27 05:15:38] [INFO ] Time to serialize gal into /tmp/LTL9110259946067120592.gal : 9 ms
[2026-05-27 05:15:38] [INFO ] Time to serialize properties into /tmp/LTL3436034153154359957.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/LTL9110259946067120592.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13416644645640636354.hoa' '-atoms' '/tmp/LTL3436034153154359957.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...318
Loading property file /tmp/LTL3436034153154359957.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13416644645640636354.hoa
Detected timeout of ITS tools.
[2026-05-27 05:15:53] [INFO ] Flatten gal took : 32 ms
[2026-05-27 05:15:53] [INFO ] Flatten gal took : 29 ms
[2026-05-27 05:15:53] [INFO ] Time to serialize gal into /tmp/LTL15806631357652776686.gal : 6 ms
[2026-05-27 05:15:53] [INFO ] Time to serialize properties into /tmp/LTL1124626833810724966.ltl : 3 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/LTL15806631357652776686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1124626833810724966.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 : !((G(F("(((((y_0>=1)&&(P_awaity_2>=1))||((y_0>=1)&&(P_awaity_3>=1)))||(((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_6>=1))))||(((...1871
Formula 0 simplified : FG!"(((((y_0>=1)&&(P_awaity_2>=1))||((y_0>=1)&&(P_awaity_3>=1)))||(((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_6>=1))))||((((y...1865
Detected timeout of ITS tools.
[2026-05-27 05:16:08] [INFO ] Flatten gal took : 27 ms
[2026-05-27 05:16:08] [INFO ] Applying decomposition
[2026-05-27 05:16:08] [INFO ] Flatten gal took : 25 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/graph4616602855301645171.txt' '-o' '/tmp/graph4616602855301645171.bin' '-w' '/tmp/graph4616602855301645171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4616602855301645171.bin' '-l' '-1' '-v' '-w' '/tmp/graph4616602855301645171.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:16:08] [INFO ] Decomposing Gal with order
[2026-05-27 05:16:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:16:09] [INFO ] Removed a total of 525 redundant transitions.
[2026-05-27 05:16:09] [INFO ] Flatten gal took : 135 ms
[2026-05-27 05:16:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 22 ms.
[2026-05-27 05:16:09] [INFO ] Time to serialize gal into /tmp/LTL2913539824707267239.gal : 12 ms
[2026-05-27 05:16:09] [INFO ] Time to serialize properties into /tmp/LTL9233058886939696427.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/LTL2913539824707267239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9233058886939696427.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i10.u29.y_0>=1)&&(i6.u23.P_awaity_2>=1))||((i10.u29.y_0>=1)&&(i1.u24.P_awaity_3>=1)))||(((i10.u29.y_0>=1)&&(i0.u22.P_awai...2712
Formula 0 simplified : FG!"(((((i10.u29.y_0>=1)&&(i6.u23.P_awaity_2>=1))||((i10.u29.y_0>=1)&&(i1.u24.P_awaity_3>=1)))||(((i10.u29.y_0>=1)&&(i0.u22.P_awaity...2706
Detected timeout of ITS tools.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-01 finished in 142391 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(X(F(p1)))&&p0))))'
Support contains 15 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:16:24] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4032319255675954626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8470956504769394028.kers'
[2026-05-27 05:16:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4032319255675954626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8470956504769394028.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 212 cols 1036 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:16:24] [INFO ] Computed 65 invariants in 2 ms
Computed 65 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8470956504769394028.kers
Total runtime 3 ms.
[2026-05-27 05:16:24] [INFO ] Implicit Places using invariants in 403 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 405 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 5 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 415 ms. Remains : 212/219 places, 420/420 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(X(F(p1)))&&p0))))'
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-02
Product exploration explored 100000 steps with 11466 reset in 366 ms.
Product exploration explored 100000 steps with 11350 reset in 291 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 56 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 182 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 302 ms.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 8 out of 212 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 420/420 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:16:26] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6231272537229640199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9615827553152673655.kers'
[2026-05-27 05:16:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6231272537229640199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9615827553152673655.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 205 cols 1022 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:16:26] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9615827553152673655.kers
Total runtime 3 ms.
[2026-05-27 05:16:26] [INFO ] Implicit Places using invariants in 283 ms returned []
[2026-05-27 05:16:26] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:16:26] [INFO ] Invariant cache hit.
[2026-05-27 05:16:26] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:16:26] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-27 05:16:26] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:16:26] [INFO ] Invariant cache hit.
[2026-05-27 05:16:26] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/212 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 212/520 variables, and 158 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/212 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 67/76 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 7/212 variables, 49/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 33/158 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 11/181 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 11 (OVERLAPS) 308/520 variables, 212/403 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 35/438 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 413/851 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 851 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 133/133 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in LTL mode , in 1 iterations and 60989 ms. Remains : 212/212 places, 420/420 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 48 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 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 58 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 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 289 ms.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11344 reset in 252 ms.
Product exploration explored 100000 steps with 11356 reset in 286 ms.
Spot run failed in 112 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/ltsmin10696650504696360015
[2026-05-27 05:17:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10696650504696360015
Running compilation step : cd /tmp/ltsmin10696650504696360015;'/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 994 ms.
Running link step : cd /tmp/ltsmin10696650504696360015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10696650504696360015;'/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/stateBased12275795149020927948.hoa' '--buchi-type=spotba'
LTSmin run took 7175 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLFireability-02 finished in 72319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0&&X((!p0&&F(G(p1))))))))'
Support contains 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:17:36] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1890376787466186828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9473949769898101654.kers'
[2026-05-27 05:17:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1890376787466186828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9473949769898101654.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 212 cols 1036 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:17:36] [INFO ] Computed 65 invariants in 1 ms
Computed 65 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9473949769898101654.kers
Total runtime 2 ms.
[2026-05-27 05:17:36] [INFO ] Implicit Places using invariants in 264 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 265 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 271 ms. Remains : 212/219 places, 420/420 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&&F(G(p1))))&&p0))))'
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-03 finished in 492 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(p2)&&p1)))))'
Support contains 43 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 10 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:17:37] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:17:37] [INFO ] Invariant cache hit.
[2026-05-27 05:17:37] [INFO ] Implicit Places using invariants in 298 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 300 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 212 transition count 413
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 413
Applied a total of 14 rules in 19 ms. Remains 205 /212 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2026-05-27 05:17:37] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17934502776801867775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15437643366101604377.kers'
[2026-05-27 05:17:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17934502776801867775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15437643366101604377.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 301 rows 198 cols 1050 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-27 05:17:37] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15437643366101604377.kers
Total runtime 3 ms.
[2026-05-27 05:17:37] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-27 05:17:37] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
[2026-05-27 05:17:37] [INFO ] Invariant cache hit.
[2026-05-27 05:17:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:17:38] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 205/219 places, 413/420 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1114 ms. Remains : 205/219 places, 413/420 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(G(p2)&&p1)))))'
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-04
Product exploration explored 100000 steps with 4825 reset in 770 ms.
Product exploration explored 100000 steps with 4799 reset in 769 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 10 factoid took 130 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 288 steps (0 resets) in 9 ms. (28 steps per ms) remains 0/7 properties
Knowledge based reduction with 10 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 454 ms.
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 43 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 413/413 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2026-05-27 05:17:40] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
[2026-05-27 05:17:40] [INFO ] Invariant cache hit.
[2026-05-27 05:17:40] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-27 05:17:40] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
[2026-05-27 05:17:40] [INFO ] Invariant cache hit.
[2026-05-27 05:17:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:17:41] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2026-05-27 05:17:41] [INFO ] Redundant transitions in 5 ms returned []
Running 406 sub problems to find dead transitions.
[2026-05-27 05:17:41] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
[2026-05-27 05:17:41] [INFO ] Invariant cache hit.
[2026-05-27 05:17:41] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 7/205 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 406 unsolved
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 30183ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30985 ms. Remains : 205/205 places, 413/413 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 10 factoid took 115 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 180 steps (0 resets) in 9 ms. (18 steps per ms) remains 0/7 properties
Knowledge based reduction with 10 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 434 ms.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4846 reset in 928 ms.
Product exploration explored 100000 steps with 4840 reset in 932 ms.
Built C files in :
/tmp/ltsmin15259644392100622557
[2026-05-27 05:18:13] [INFO ] Computing symmetric may disable matrix : 413 transitions.
[2026-05-27 05:18:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:18:13] [INFO ] Computing symmetric may enable matrix : 413 transitions.
[2026-05-27 05:18:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:18:14] [INFO ] Computing Do-Not-Accords matrix : 413 transitions.
[2026-05-27 05:18:14] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:18:14] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15259644392100622557
Running compilation step : cd /tmp/ltsmin15259644392100622557;'/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 1485 ms.
Running link step : cd /tmp/ltsmin15259644392100622557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15259644392100622557;'/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/stateBased4018225365010522140.hoa' '--buchi-type=spotba'
LTSmin run took 884 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLFireability-04 finished in 39396 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((X(X(X(X(X(X(F(p1)))))))||p0)))'
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:18:16] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14552768281512630676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5797938767784965253.kers'
[2026-05-27 05:18:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14552768281512630676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5797938767784965253.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 212 cols 1036 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:18:16] [INFO ] Computed 65 invariants in 2 ms
Computed 65 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5797938767784965253.kers
Total runtime 2 ms.
[2026-05-27 05:18:16] [INFO ] Implicit Places using invariants in 318 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 322 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 212/219 places, 420/420 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((X(X(X(X(X(X(F(p1)))))))||p0)))'
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-05
Product exploration explored 100000 steps with 7160 reset in 366 ms.
Product exploration explored 100000 steps with 7185 reset in 386 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 80 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2026-05-27 05:18:18] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9337419335021391576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12732594746008885628.kers'
[2026-05-27 05:18:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9337419335021391576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12732594746008885628.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 205 cols 1022 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:18:18] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12732594746008885628.kers
Total runtime 3 ms.
[2026-05-27 05:18:18] [INFO ] [Real]Absence check using 58 positive place invariants in 41 ms returned sat
[2026-05-27 05:18:19] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2026-05-27 05:18:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:18:19] [INFO ] [Nat]Absence check using 58 positive place invariants in 45 ms returned sat
[2026-05-27 05:18:20] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2026-05-27 05:18:20] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:18:20] [INFO ] [Nat]Added 35 Read/Feed constraints in 17 ms returned sat
[2026-05-27 05:18:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 794 ms
[2026-05-27 05:18:20] [INFO ] Computed and/alt/rep : 273/1575/273 causal constraints (skipped 28 transitions) in 30 ms.
[2026-05-27 05:18:22] [INFO ] Added : 161 causal constraints over 33 iterations in 1150 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 4253 ms.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:18:22] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:18:22] [INFO ] Invariant cache hit.
[2026-05-27 05:18:22] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-27 05:18:22] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:18:22] [INFO ] Invariant cache hit.
[2026-05-27 05:18:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:18:23] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-27 05:18:23] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:18:23] [INFO ] Invariant cache hit.
[2026-05-27 05:18:23] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/212 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 413 unsolved
SMT process timed out in 30143ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 30145ms
Finished structural reductions in LTL mode , in 1 iterations and 30879 ms. Remains : 212/212 places, 420/420 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 80 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2026-05-27 05:18:53] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:18:53] [INFO ] Invariant cache hit.
[2026-05-27 05:18:54] [INFO ] [Real]Absence check using 58 positive place invariants in 58 ms returned sat
[2026-05-27 05:18:55] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2026-05-27 05:18:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:18:55] [INFO ] [Nat]Absence check using 58 positive place invariants in 52 ms returned sat
[2026-05-27 05:18:56] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2026-05-27 05:18:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:18:56] [INFO ] [Nat]Added 35 Read/Feed constraints in 20 ms returned sat
[2026-05-27 05:18:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 969 ms
[2026-05-27 05:18:57] [INFO ] Computed and/alt/rep : 273/1575/273 causal constraints (skipped 28 transitions) in 29 ms.
[2026-05-27 05:18:58] [INFO ] Added : 161 causal constraints over 33 iterations in 1111 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 4963 ms.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7147 reset in 370 ms.
Stack based approach found an accepted trace after 16786 steps with 1193 reset with depth 97 and stack size 97 in 70 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-05 finished in 42687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 92 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:18:59] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7577915737176681269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18056899488180504049.kers'
[2026-05-27 05:18:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7577915737176681269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18056899488180504049.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 212 cols 1036 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:18:59] [INFO ] Computed 65 invariants in 1 ms
Computed 65 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18056899488180504049.kers
Total runtime 2 ms.
[2026-05-27 05:18:59] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-27 05:18:59] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:18:59] [INFO ] Invariant cache hit.
[2026-05-27 05:18:59] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-27 05:18:59] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-27 05:18:59] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:18:59] [INFO ] Invariant cache hit.
[2026-05-27 05:18:59] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/527 variables, and 145 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 0/219 constraints, ReadFeed: 0/84 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 7/219 variables, 56/117 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 28/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 17/162 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 15/177 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 18/215 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 219/527 variables, and 218 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 0/219 constraints, ReadFeed: 0/84 constraints, PredecessorRefiner: 0/413 constraints, Known Traps: 153/153 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Finished structural reductions in LTL mode , in 1 iterations and 60758 ms. Remains : 219/219 places, 420/420 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-06 finished in 60917 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 U !p2)) U ((F(p1)||p3) U p4)))'
Support contains 50 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Applied a total of 14 rules in 13 ms. Remains 212 /219 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2026-05-27 05:20:00] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4725454722370152356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5636549144951583454.kers'
[2026-05-27 05:20:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4725454722370152356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5636549144951583454.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 301 rows 205 cols 1022 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-27 05:20:00] [INFO ] Computed 65 invariants in 3 ms
Computed 65 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5636549144951583454.kers
Total runtime 4 ms.
[2026-05-27 05:20:00] [INFO ] Implicit Places using invariants in 375 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 377 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 413/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 406
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 406
Applied a total of 14 rules in 12 ms. Remains 198 /205 variables (removed 7) and now considering 406/413 (removed 7) transitions.
[2026-05-27 05:20:00] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14814574488774101884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14496452271196625758.kers'
[2026-05-27 05:20:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14814574488774101884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14496452271196625758.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 191 cols 1036 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 05:20:00] [INFO ] Computed 58 invariants in 3 ms
Computed 58 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14496452271196625758.kers
Total runtime 4 ms.
[2026-05-27 05:20:00] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-27 05:20:00] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:00] [INFO ] Invariant cache hit.
[2026-05-27 05:20:01] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:20:01] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 406/420 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1307 ms. Remains : 198/219 places, 406/420 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 U !p2)) U ((F(p1)||p3) U p4)))'
Stuttering acceptance computed with spot in 198 ms :[(NOT p4), (NOT p1), (NOT p4), (AND (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-07
Product exploration explored 100000 steps with 5715 reset in 697 ms.
Product exploration explored 100000 steps with 5673 reset in 566 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 19 factoid took 197 ms. Reduced automaton from 4 states, 9 edges and 5 AP (stutter insensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 507 ms. (78 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 821 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 936 ms. (42 steps per ms) remains 2/2 properties
[2026-05-27 05:20:03] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:03] [INFO ] Invariant cache hit.
[2026-05-27 05:20:03] [INFO ] State equation strengthened by 35 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 155/198 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 294/492 variables, 198/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 35/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 155/198 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/492 variables, 198/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 35/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1238ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 203 ms.
Support contains 43 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 14 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 198/198 places, 406/406 transitions.
RANDOM walk for 40000 steps (8 resets) in 369 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 310089 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 310089 steps, saw 151459 distinct states, run finished after 3006 ms. (steps per millisecond=103 ) properties seen :0
[2026-05-27 05:20:08] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:08] [INFO ] Invariant cache hit.
[2026-05-27 05:20:08] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 155/198 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 294/492 variables, 198/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 35/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 155/198 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/492 variables, 198/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 35/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1180 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1457ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 318 ms.
Support contains 43 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 14 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 14 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-27 05:20:10] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:10] [INFO ] Invariant cache hit.
[2026-05-27 05:20:10] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-27 05:20:10] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:10] [INFO ] Invariant cache hit.
[2026-05-27 05:20:10] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:20:11] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2026-05-27 05:20:11] [INFO ] Redundant transitions in 6 ms returned []
Running 399 sub problems to find dead transitions.
[2026-05-27 05:20:11] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:11] [INFO ] Invariant cache hit.
[2026-05-27 05:20:11] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 7/198 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 399 unsolved
SMT process timed out in 30326ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 30329ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31243 ms. Remains : 198/198 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 198 transition count 294
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 112 place count 198 transition count 245
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 252 place count 107 transition count 245
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 280 place count 93 transition count 231
Applied a total of 280 rules in 14 ms. Remains 93 /198 variables (removed 105) and now considering 231/406 (removed 175) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9762818643501217789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10924399335644777419.kers'
[2026-05-27 05:20:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9762818643501217789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10924399335644777419.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 231 rows 86 cols 791 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-27 05:20:41] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10924399335644777419.kers
Total runtime 2 ms.
[2026-05-27 05:20:41] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-27 05:20:41] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-27 05:20:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-27 05:20:41] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-27 05:20:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2026-05-27 05:20:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
TRAPS : Iteration 1
[2026-05-27 05:20:42] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-27 05:20:42] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 575 ms.
Knowledge based reduction with 19 factoid took 279 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p1) (NOT p4)), (NOT p1), (NOT p4), false, false, false, false, false, false]
[2026-05-27 05:20:42] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5616209881782291129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14697669242926772456.kers'
[2026-05-27 05:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5616209881782291129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14697669242926772456.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 191 cols 1036 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 05:20:42] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14697669242926772456.kers
Total runtime 2 ms.
[2026-05-27 05:20:43] [INFO ] [Real]Absence check using 58 positive place invariants in 34 ms returned sat
[2026-05-27 05:20:43] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2026-05-27 05:20:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:20:43] [INFO ] [Nat]Absence check using 58 positive place invariants in 41 ms returned sat
[2026-05-27 05:20:44] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2026-05-27 05:20:44] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:20:44] [INFO ] [Nat]Added 35 Read/Feed constraints in 24 ms returned sat
[2026-05-27 05:20:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 536 ms
[2026-05-27 05:20:44] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 28 ms.
[2026-05-27 05:20:46] [INFO ] Added : 204 causal constraints over 41 iterations in 1489 ms. Result :sat
Could not prove EG (NOT p1)
[2026-05-27 05:20:46] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:46] [INFO ] Invariant cache hit.
[2026-05-27 05:20:46] [INFO ] [Real]Absence check using 58 positive place invariants in 37 ms returned sat
[2026-05-27 05:20:46] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2026-05-27 05:20:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:20:47] [INFO ] [Nat]Absence check using 58 positive place invariants in 45 ms returned sat
[2026-05-27 05:20:47] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2026-05-27 05:20:47] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:20:47] [INFO ] [Nat]Added 35 Read/Feed constraints in 27 ms returned sat
[2026-05-27 05:20:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1423 ms
[2026-05-27 05:20:48] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 30 ms.
[2026-05-27 05:20:50] [INFO ] Added : 223 causal constraints over 45 iterations in 1545 ms. Result :sat
Could not prove EG (NOT p4)
Knowledge-based reduction took 47570 ms.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (NOT p4)), (NOT p1), (NOT p4), false, false, false, false, false, false]
Support contains 43 out of 198 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-27 05:20:50] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:50] [INFO ] Invariant cache hit.
[2026-05-27 05:20:51] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-27 05:20:51] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:51] [INFO ] Invariant cache hit.
[2026-05-27 05:20:51] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:20:51] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2026-05-27 05:20:51] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 699 ms. Remains : 198/198 places, 406/406 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 19 factoid took 112 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 490 ms. (81 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
[2026-05-27 05:20:51] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:51] [INFO ] Invariant cache hit.
[2026-05-27 05:20:51] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 155/198 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 294/492 variables, 198/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 35/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 155/198 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/492 variables, 198/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 35/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 981 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1273ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 179 ms.
Support contains 43 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 198/198 places, 406/406 transitions.
RANDOM walk for 40000 steps (8 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 317262 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 2
Probabilistic random walk after 317262 steps, saw 154871 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2026-05-27 05:20:56] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:56] [INFO ] Invariant cache hit.
[2026-05-27 05:20:56] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 155/198 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 294/492 variables, 198/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 35/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 155/198 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/492 variables, 198/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 35/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 971 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1260ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 215 ms.
Support contains 43 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-27 05:20:58] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:58] [INFO ] Invariant cache hit.
[2026-05-27 05:20:58] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-27 05:20:58] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:20:58] [INFO ] Invariant cache hit.
[2026-05-27 05:20:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:20:58] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2026-05-27 05:20:58] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 813 ms. Remains : 198/198 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 198 transition count 294
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 112 place count 198 transition count 245
Deduced a syphon composed of 49 places in 1 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 252 place count 107 transition count 245
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 280 place count 93 transition count 231
Applied a total of 280 rules in 11 ms. Remains 93 /198 variables (removed 105) and now considering 231/406 (removed 175) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7337188822046231574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12319880540123911562.kers'
[2026-05-27 05:20:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7337188822046231574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12319880540123911562.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 231 rows 86 cols 791 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-27 05:20:58] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12319880540123911562.kers
Total runtime 2 ms.
[2026-05-27 05:20:58] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-27 05:20:58] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-27 05:20:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-27 05:20:59] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-27 05:20:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 133 ms
[2026-05-27 05:20:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
TRAPS : Iteration 1
[2026-05-27 05:20:59] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-27 05:20:59] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 595 ms.
Knowledge based reduction with 19 factoid took 250 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p1) (NOT p4)), (NOT p1), (NOT p4), false, false, false, false, false, false]
[2026-05-27 05:21:00] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12557818904664363143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6198570347689774614.kers'
[2026-05-27 05:21:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12557818904664363143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6198570347689774614.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 191 cols 1036 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 05:21:00] [INFO ] Computed 58 invariants in 3 ms
Computed 58 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6198570347689774614.kers
Total runtime 4 ms.
[2026-05-27 05:21:00] [INFO ] [Real]Absence check using 58 positive place invariants in 35 ms returned sat
[2026-05-27 05:21:00] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2026-05-27 05:21:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:21:01] [INFO ] [Nat]Absence check using 58 positive place invariants in 61 ms returned sat
[2026-05-27 05:21:01] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2026-05-27 05:21:01] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:21:01] [INFO ] [Nat]Added 35 Read/Feed constraints in 23 ms returned sat
[2026-05-27 05:21:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 543 ms
[2026-05-27 05:21:02] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 28 ms.
[2026-05-27 05:21:03] [INFO ] Added : 204 causal constraints over 41 iterations in 1468 ms. Result :sat
Could not prove EG (NOT p1)
[2026-05-27 05:21:03] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:21:03] [INFO ] Invariant cache hit.
[2026-05-27 05:21:04] [INFO ] [Real]Absence check using 58 positive place invariants in 39 ms returned sat
[2026-05-27 05:21:04] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2026-05-27 05:21:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:21:04] [INFO ] [Nat]Absence check using 58 positive place invariants in 47 ms returned sat
[2026-05-27 05:21:05] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2026-05-27 05:21:05] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:21:05] [INFO ] [Nat]Added 35 Read/Feed constraints in 29 ms returned sat
[2026-05-27 05:21:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1440 ms
[2026-05-27 05:21:06] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 23 ms.
[2026-05-27 05:21:08] [INFO ] Added : 223 causal constraints over 45 iterations in 1601 ms. Result :sat
Could not prove EG (NOT p4)
Knowledge-based reduction took 16783 ms.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p1) (NOT p4)), (NOT p1), (NOT p4), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p4)), (NOT p1), (NOT p4), false, false, false, false, false, false]
Product exploration explored 100000 steps with 5691 reset in 426 ms.
Product exploration explored 100000 steps with 5685 reset in 445 ms.
Built C files in :
/tmp/ltsmin7859017284117413623
[2026-05-27 05:21:09] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2026-05-27 05:21:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:21:09] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2026-05-27 05:21:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:21:09] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2026-05-27 05:21:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:21:09] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7859017284117413623
Running compilation step : cd /tmp/ltsmin7859017284117413623;'/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 1437 ms.
Running link step : cd /tmp/ltsmin7859017284117413623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7859017284117413623;'/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/stateBased1898718414286104558.hoa' '--buchi-type=spotba'
LTSmin run took 784 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLFireability-07 finished in 72054 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 G(p1))||X(X(p2))))&&F(p3)))'
Support contains 134 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:21:12] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17181714823330224083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11255854659693173456.kers'
[2026-05-27 05:21:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17181714823330224083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11255854659693173456.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 212 cols 1036 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:21:12] [INFO ] Computed 65 invariants in 1 ms
Computed 65 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11255854659693173456.kers
Total runtime 2 ms.
[2026-05-27 05:21:12] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-27 05:21:12] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:21:12] [INFO ] Invariant cache hit.
[2026-05-27 05:21:12] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-27 05:21:12] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-27 05:21:12] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:21:12] [INFO ] Invariant cache hit.
[2026-05-27 05:21:12] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
SMT process timed out in 30196ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 30197ms
Finished structural reductions in LTL mode , in 1 iterations and 30702 ms. Remains : 219/219 places, 420/420 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 G(p1))||X(X(p2))))&&F(p3)))'
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-08
Entered a terminal (fully accepting) state of product in 161 steps with 2 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-08 finished in 31178 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&&X((X(X(p1)) U (X(X(G(p1)))||(!p2&&X(X(p1))))))))))'
Support contains 43 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:21:43] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:21:43] [INFO ] Invariant cache hit.
[2026-05-27 05:21:43] [INFO ] Implicit Places using invariants in 245 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 247 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 257 ms. Remains : 212/219 places, 420/420 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((X((X(X(p0)) U (X(X(G(p0)))||(!p1&&X(X(p0))))))&&p2))))'
Stuttering acceptance computed with spot in 538 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-11
Product exploration explored 100000 steps with 1839 reset in 851 ms.
Product exploration explored 100000 steps with 1842 reset in 858 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 7 factoid took 221 ms. Reduced automaton from 14 states, 45 edges and 3 AP (stutter sensitive) to 14 states, 45 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 352 ms. (113 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 2/2 properties
[2026-05-27 05:21:46] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2126449754105233657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4631830501942721987.kers'
[2026-05-27 05:21:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2126449754105233657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4631830501942721987.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 205 cols 1022 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:21:46] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4631830501942721987.kers
Total runtime 4 ms.
[2026-05-27 05:21:46] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/204 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 308/512 variables, 204/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 35/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/520 variables, 8/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/520 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 305 constraints, problems are : Problem set: 0 solved, 2 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/204 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 308/512 variables, 204/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 35/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/520 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/520 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1735ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 168 ms.
Support contains 43 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 420/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 212 transition count 413
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 413
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 198 transition count 406
Applied a total of 28 rules in 21 ms. Remains 198 /212 variables (removed 14) and now considering 406/420 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 198/212 places, 406/420 transitions.
RANDOM walk for 40000 steps (8 resets) in 670 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 657 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 336509 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 336509 steps, saw 162600 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2026-05-27 05:21:51] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13768334793806716361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11086401187403477916.kers'
[2026-05-27 05:21:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13768334793806716361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11086401187403477916.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 191 cols 1036 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 05:21:52] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11086401187403477916.kers
Total runtime 2 ms.
[2026-05-27 05:21:52] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 147/190 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 294/484 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 35/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/492 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 147/190 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 294/484 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 35/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/492 variables, 8/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/492 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 874ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 43 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-27 05:21:53] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:21:53] [INFO ] Invariant cache hit.
[2026-05-27 05:21:53] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-27 05:21:53] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:21:53] [INFO ] Invariant cache hit.
[2026-05-27 05:21:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:21:53] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2026-05-27 05:21:53] [INFO ] Redundant transitions in 3 ms returned []
Running 399 sub problems to find dead transitions.
[2026-05-27 05:21:53] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:21:53] [INFO ] Invariant cache hit.
[2026-05-27 05:21:53] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 7/198 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 399 unsolved
SMT process timed out in 30150ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 30151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30854 ms. Remains : 198/198 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 198 transition count 294
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 112 place count 198 transition count 245
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 252 place count 107 transition count 245
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 266 place count 100 transition count 238
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 273 place count 100 transition count 231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 280 place count 93 transition count 231
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 93 transition count 231
Applied a total of 287 rules in 16 ms. Remains 93 /198 variables (removed 105) and now considering 231/406 (removed 175) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17603293300275223990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1363607805308686203.kers'
[2026-05-27 05:22:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17603293300275223990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1363607805308686203.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 231 rows 86 cols 791 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-27 05:22:23] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1363607805308686203.kers
Total runtime 1 ms.
[2026-05-27 05:22:23] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-27 05:22:23] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-27 05:22:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-27 05:22:24] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-27 05:22:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
TRAPS : Iteration 1
[2026-05-27 05:22:24] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-27 05:22:24] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 386 ms.
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 14 states, 45 edges and 3 AP (stutter sensitive) to 14 states, 45 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 566 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2026-05-27 05:22:25] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15254971439726624683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8001097730950633522.kers'
[2026-05-27 05:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15254971439726624683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8001097730950633522.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 205 cols 1022 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:22:25] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8001097730950633522.kers
Total runtime 2 ms.
[2026-05-27 05:22:25] [INFO ] [Real]Absence check using 58 positive place invariants in 40 ms returned sat
[2026-05-27 05:22:25] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2026-05-27 05:22:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:22:26] [INFO ] [Nat]Absence check using 58 positive place invariants in 50 ms returned sat
[2026-05-27 05:22:26] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2026-05-27 05:22:26] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:22:26] [INFO ] [Nat]Added 35 Read/Feed constraints in 19 ms returned sat
[2026-05-27 05:22:28] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1505 ms
[2026-05-27 05:22:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1506 ms
[2026-05-27 05:22:28] [INFO ] Computed and/alt/rep : 273/1575/273 causal constraints (skipped 28 transitions) in 27 ms.
[2026-05-27 05:22:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 763 ms
[2026-05-27 05:22:31] [INFO ] Added : 249 causal constraints over 51 iterations in 2800 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 45289 ms.
Stuttering acceptance computed with spot in 550 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 43 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:22:31] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:22:31] [INFO ] Invariant cache hit.
[2026-05-27 05:22:31] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-27 05:22:31] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:22:31] [INFO ] Invariant cache hit.
[2026-05-27 05:22:32] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:22:32] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-27 05:22:32] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:22:32] [INFO ] Invariant cache hit.
[2026-05-27 05:22:32] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/212 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 212/520 variables, and 138 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/212 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 7/212 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 28/138 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 11 (OVERLAPS) 308/520 variables, 212/407 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 35/442 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 855 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 137/137 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Finished structural reductions in LTL mode , in 1 iterations and 60841 ms. Remains : 212/212 places, 420/420 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 14 states, 45 edges and 3 AP (stutter sensitive) to 14 states, 45 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
[2026-05-27 05:23:32] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2026-05-27 05:23:32] [INFO ] Invariant cache hit.
[2026-05-27 05:23:32] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/204 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 308/512 variables, 204/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 35/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/520 variables, 8/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/520 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 305 constraints, problems are : Problem set: 0 solved, 2 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 161/204 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 308/512 variables, 204/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 35/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/520 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/520 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1293ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 43 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 420/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 212 transition count 413
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 413
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 198 transition count 406
Applied a total of 28 rules in 11 ms. Remains 198 /212 variables (removed 14) and now considering 406/420 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 198/212 places, 406/420 transitions.
RANDOM walk for 40000 steps (8 resets) in 291 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 379922 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 2
Probabilistic random walk after 379922 steps, saw 180366 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2026-05-27 05:23:37] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15648922032306048037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13721257335780603058.kers'
[2026-05-27 05:23:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15648922032306048037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13721257335780603058.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 191 cols 1036 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 05:23:37] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13721257335780603058.kers
Total runtime 3 ms.
[2026-05-27 05:23:37] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 147/190 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 294/484 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 35/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/492 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 147/190 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 294/484 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 35/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/492 variables, 8/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/492 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 855ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 129 ms.
Support contains 43 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-27 05:23:38] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:23:38] [INFO ] Invariant cache hit.
[2026-05-27 05:23:38] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-27 05:23:38] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:23:38] [INFO ] Invariant cache hit.
[2026-05-27 05:23:39] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:23:39] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2026-05-27 05:23:39] [INFO ] Redundant transitions in 3 ms returned []
Running 399 sub problems to find dead transitions.
[2026-05-27 05:23:39] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:23:39] [INFO ] Invariant cache hit.
[2026-05-27 05:23:39] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 7/198 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 399 unsolved
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 30109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30835 ms. Remains : 198/198 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 198 transition count 294
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 112 place count 198 transition count 245
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 252 place count 107 transition count 245
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 266 place count 100 transition count 238
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 273 place count 100 transition count 231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 280 place count 93 transition count 231
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 93 transition count 231
Applied a total of 287 rules in 19 ms. Remains 93 /198 variables (removed 105) and now considering 231/406 (removed 175) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7077261340803203523.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16447534861224583805.kers'
[2026-05-27 05:24:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7077261340803203523.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16447534861224583805.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 231 rows 86 cols 791 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-27 05:24:09] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16447534861224583805.kers
Total runtime 1 ms.
[2026-05-27 05:24:09] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-27 05:24:09] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-27 05:24:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-27 05:24:09] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-27 05:24:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
TRAPS : Iteration 1
[2026-05-27 05:24:09] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-27 05:24:09] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 531 ms.
Knowledge based reduction with 7 factoid took 290 ms. Reduced automaton from 14 states, 45 edges and 3 AP (stutter sensitive) to 14 states, 45 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 598 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2026-05-27 05:24:10] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-175247687003762574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6876391509242559957.kers'
[2026-05-27 05:24:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-175247687003762574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6876391509242559957.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 205 cols 1022 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:24:10] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6876391509242559957.kers
Total runtime 2 ms.
[2026-05-27 05:24:11] [INFO ] [Real]Absence check using 58 positive place invariants in 57 ms returned sat
[2026-05-27 05:24:11] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2026-05-27 05:24:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:24:12] [INFO ] [Nat]Absence check using 58 positive place invariants in 77 ms returned sat
[2026-05-27 05:24:13] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2026-05-27 05:24:13] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:24:13] [INFO ] [Nat]Added 35 Read/Feed constraints in 22 ms returned sat
[2026-05-27 05:24:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2381 ms
[2026-05-27 05:24:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2382 ms
[2026-05-27 05:24:15] [INFO ] Computed and/alt/rep : 273/1575/273 causal constraints (skipped 28 transitions) in 37 ms.
[2026-05-27 05:24:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1125 ms
[2026-05-27 05:24:19] [INFO ] Added : 249 causal constraints over 51 iterations in 3867 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 46985 ms.
Stuttering acceptance computed with spot in 734 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 757 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1848 reset in 989 ms.
Stack based approach found an accepted trace after 79811 steps with 1459 reset with depth 110 and stack size 110 in 684 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-11 finished in 159433 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))||G(!p1)||(X(G(p0))&&(!p1 U p2))))'
Support contains 42 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2026-05-27 05:24:22] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14056031184154566427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6114720801840376897.kers'
[2026-05-27 05:24:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14056031184154566427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6114720801840376897.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 308 rows 212 cols 1036 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 05:24:22] [INFO ] Computed 65 invariants in 1 ms
Computed 65 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6114720801840376897.kers
Total runtime 2 ms.
[2026-05-27 05:24:23] [INFO ] Implicit Places using invariants in 309 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 311 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 316 ms. Remains : 212/219 places, 420/420 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))||G(p1)||(X(G(!p0))&&(p1 U p2))))'
Stuttering acceptance computed with spot in 726 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2) (NOT p0)), p0, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (NOT p0), true, false, false, (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 713 ms.
Product exploration explored 100000 steps with 33333 reset in 537 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 21 factoid took 12 ms. Proved property starting from automaton with 15 states, 40 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 16 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-7-LTLFireability-13 finished in 2349 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)||(!p1 U ((p3 U p0)||p2))))'
Support contains 58 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Applied a total of 14 rules in 12 ms. Remains 212 /219 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2026-05-27 05:24:25] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17168010143366681756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8895410407567735202.kers'
[2026-05-27 05:24:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17168010143366681756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8895410407567735202.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 301 rows 205 cols 1022 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-27 05:24:25] [INFO ] Computed 65 invariants in 2 ms
Computed 65 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8895410407567735202.kers
Total runtime 3 ms.
[2026-05-27 05:24:25] [INFO ] Implicit Places using invariants in 369 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 371 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 413/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 406
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 406
Applied a total of 14 rules in 12 ms. Remains 198 /205 variables (removed 7) and now considering 406/413 (removed 7) transitions.
[2026-05-27 05:24:25] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8055579171759255469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-806725861297817866.kers'
[2026-05-27 05:24:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8055579171759255469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-806725861297817866.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 191 cols 1036 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 05:24:25] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-806725861297817866.kers
Total runtime 3 ms.
[2026-05-27 05:24:25] [INFO ] Implicit Places using invariants in 304 ms returned []
[2026-05-27 05:24:25] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:24:25] [INFO ] Invariant cache hit.
[2026-05-27 05:24:26] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:24:26] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 406/420 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1328 ms. Remains : 198/219 places, 406/420 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)||(!p1 U ((p3 U !p0)||p2))))'
Stuttering acceptance computed with spot in 162 ms :[true, false, false, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-14
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-14 finished in 1529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 30 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Applied a total of 14 rules in 11 ms. Remains 212 /219 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2026-05-27 05:24:26] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13266343995126556908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2443905392885163415.kers'
[2026-05-27 05:24:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13266343995126556908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2443905392885163415.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 301 rows 205 cols 1022 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-27 05:24:26] [INFO ] Computed 65 invariants in 2 ms
Computed 65 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2443905392885163415.kers
Total runtime 3 ms.
[2026-05-27 05:24:27] [INFO ] Implicit Places using invariants in 393 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 395 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 413/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 406
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 406
Applied a total of 14 rules in 11 ms. Remains 198 /205 variables (removed 7) and now considering 406/413 (removed 7) transitions.
[2026-05-27 05:24:27] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17809331865497063253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7998286566665864642.kers'
[2026-05-27 05:24:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17809331865497063253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7998286566665864642.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 294 rows 191 cols 1036 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 05:24:27] [INFO ] Computed 58 invariants in 3 ms
Computed 58 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7998286566665864642.kers
Total runtime 4 ms.
[2026-05-27 05:24:27] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-27 05:24:27] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:24:27] [INFO ] Invariant cache hit.
[2026-05-27 05:24:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:24:27] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 406/420 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1226 ms. Remains : 198/219 places, 406/420 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-15
Product exploration explored 100000 steps with 7293 reset in 998 ms.
Product exploration explored 100000 steps with 7259 reset in 827 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 49 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2026-05-27 05:24:29] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:24:29] [INFO ] Invariant cache hit.
[2026-05-27 05:24:30] [INFO ] [Real]Absence check using 58 positive place invariants in 55 ms returned sat
[2026-05-27 05:24:31] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2026-05-27 05:24:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:24:31] [INFO ] [Nat]Absence check using 58 positive place invariants in 51 ms returned sat
[2026-05-27 05:24:32] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2026-05-27 05:24:32] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:24:32] [INFO ] [Nat]Added 35 Read/Feed constraints in 23 ms returned sat
[2026-05-27 05:24:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 786 ms
[2026-05-27 05:24:33] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 32 ms.
[2026-05-27 05:24:35] [INFO ] Added : 196 causal constraints over 40 iterations in 2238 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5680 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 30 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-27 05:24:35] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:24:35] [INFO ] Invariant cache hit.
[2026-05-27 05:24:35] [INFO ] Implicit Places using invariants in 395 ms returned []
[2026-05-27 05:24:35] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:24:35] [INFO ] Invariant cache hit.
[2026-05-27 05:24:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:24:36] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
[2026-05-27 05:24:36] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1141 ms. Remains : 198/198 places, 406/406 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 45 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 53 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2026-05-27 05:24:36] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:24:36] [INFO ] Invariant cache hit.
[2026-05-27 05:24:37] [INFO ] [Real]Absence check using 58 positive place invariants in 39 ms returned sat
[2026-05-27 05:24:37] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2026-05-27 05:24:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:24:38] [INFO ] [Nat]Absence check using 58 positive place invariants in 53 ms returned sat
[2026-05-27 05:24:39] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2026-05-27 05:24:39] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:24:39] [INFO ] [Nat]Added 35 Read/Feed constraints in 22 ms returned sat
[2026-05-27 05:24:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 586 ms
[2026-05-27 05:24:39] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 20 ms.
[2026-05-27 05:24:41] [INFO ] Added : 196 causal constraints over 40 iterations in 1360 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 4426 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7284 reset in 806 ms.
Product exploration explored 100000 steps with 7287 reset in 831 ms.
Built C files in :
/tmp/ltsmin342124628188884393
[2026-05-27 05:24:42] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2026-05-27 05:24:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:24:42] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2026-05-27 05:24:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:24:42] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2026-05-27 05:24:42] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:24:42] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin342124628188884393
Running compilation step : cd /tmp/ltsmin342124628188884393;'/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 1546 ms.
Running link step : cd /tmp/ltsmin342124628188884393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin342124628188884393;'/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/stateBased9316385213413722354.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-27 05:24:57] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:24:57] [INFO ] Invariant cache hit.
[2026-05-27 05:24:58] [INFO ] Implicit Places using invariants in 247 ms returned []
[2026-05-27 05:24:58] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2026-05-27 05:24:58] [INFO ] Invariant cache hit.
[2026-05-27 05:24:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-27 05:24:58] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2026-05-27 05:24:58] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 745 ms. Remains : 198/198 places, 406/406 transitions.
Built C files in :
/tmp/ltsmin8047262089290249445
[2026-05-27 05:24:58] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2026-05-27 05:24:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:24:58] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2026-05-27 05:24:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:24:58] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2026-05-27 05:24:58] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:24:58] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8047262089290249445
Running compilation step : cd /tmp/ltsmin8047262089290249445;'/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 1448 ms.
Running link step : cd /tmp/ltsmin8047262089290249445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8047262089290249445;'/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/stateBased9188275393662855123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 05:25:13] [INFO ] Flatten gal took : 24 ms
[2026-05-27 05:25:13] [INFO ] Flatten gal took : 23 ms
[2026-05-27 05:25:13] [INFO ] Time to serialize gal into /tmp/LTL3786456614519019087.gal : 4 ms
[2026-05-27 05:25:13] [INFO ] Time to serialize properties into /tmp/LTL14415147449898328207.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/LTL3786456614519019087.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7175144486060152770.hoa' '-atoms' '/tmp/LTL14415147449898328207.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...318
Loading property file /tmp/LTL14415147449898328207.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7175144486060152770.hoa
Detected timeout of ITS tools.
[2026-05-27 05:25:28] [INFO ] Flatten gal took : 27 ms
[2026-05-27 05:25:28] [INFO ] Flatten gal took : 18 ms
[2026-05-27 05:25:28] [INFO ] Time to serialize gal into /tmp/LTL9621512260329201145.gal : 4 ms
[2026-05-27 05:25:28] [INFO ] Time to serialize properties into /tmp/LTL13193508443285598610.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/LTL9621512260329201145.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13193508443285598610.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 : !((F("(((((((((y_1>=1)&&(P_CS_21_1>=1))||((y_1>=1)&&(P_CS_21_3>=1)))||(((y_1>=1)&&(P_CS_21_5>=1))||((y_2>=1)&&(P_CS_21_7>=1))))||((((y...3275
Formula 0 simplified : G!"(((((((((y_1>=1)&&(P_CS_21_1>=1))||((y_1>=1)&&(P_CS_21_3>=1)))||(((y_1>=1)&&(P_CS_21_5>=1))||((y_2>=1)&&(P_CS_21_7>=1))))||((((y_...3271
Detected timeout of ITS tools.
[2026-05-27 05:25:43] [INFO ] Flatten gal took : 17 ms
[2026-05-27 05:25:43] [INFO ] Applying decomposition
[2026-05-27 05:25:43] [INFO ] Flatten gal took : 17 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/graph8917313594635896915.txt' '-o' '/tmp/graph8917313594635896915.bin' '-w' '/tmp/graph8917313594635896915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8917313594635896915.bin' '-l' '-1' '-v' '-w' '/tmp/graph8917313594635896915.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:25:43] [INFO ] Decomposing Gal with order
[2026-05-27 05:25:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:25:43] [INFO ] Removed a total of 525 redundant transitions.
[2026-05-27 05:25:43] [INFO ] Flatten gal took : 66 ms
[2026-05-27 05:25:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 13 ms.
[2026-05-27 05:25:44] [INFO ] Time to serialize gal into /tmp/LTL496816451708662505.gal : 5 ms
[2026-05-27 05:25:44] [INFO ] Time to serialize properties into /tmp/LTL3461987908979882843.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/LTL496816451708662505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3461987908979882843.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...253
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((i9.u31.y_1>=1)&&(i5.u30.P_CS_21_1>=1))||((i9.u31.y_1>=1)&&(i9.u28.P_CS_21_3>=1)))||(((i9.u31.y_1>=1)&&(i7.u33.P_CS_21_5...4653
Formula 0 simplified : G!"(((((((((i9.u31.y_1>=1)&&(i5.u30.P_CS_21_1>=1))||((i9.u31.y_1>=1)&&(i9.u28.P_CS_21_3>=1)))||(((i9.u31.y_1>=1)&&(i7.u33.P_CS_21_5>...4649
Detected timeout of ITS tools.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-15 finished in 92451 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)))'
Spot run failed in 77 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(p0))'
Spot run failed in 72 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 05:25:59] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11136783528380967000
[2026-05-27 05:25:59] [INFO ] Computing symmetric may disable matrix : 420 transitions.
[2026-05-27 05:25:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:25:59] [INFO ] Computing symmetric may enable matrix : 420 transitions.
[2026-05-27 05:25:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:25:59] [INFO ] Applying decomposition
[2026-05-27 05:25:59] [INFO ] Flatten gal took : 26 ms
[2026-05-27 05:25:59] [INFO ] Computing Do-Not-Accords matrix : 420 transitions.
[2026-05-27 05:25:59] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 05:25:59] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11136783528380967000
Running compilation step : cd /tmp/ltsmin11136783528380967000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
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/graph1487307091779197611.txt' '-o' '/tmp/graph1487307091779197611.bin' '-w' '/tmp/graph1487307091779197611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1487307091779197611.bin' '-l' '-1' '-v' '-w' '/tmp/graph1487307091779197611.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:25:59] [INFO ] Decomposing Gal with order
[2026-05-27 05:25:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:25:59] [INFO ] Removed a total of 657 redundant transitions.
[2026-05-27 05:25:59] [INFO ] Flatten gal took : 72 ms
[2026-05-27 05:25:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 25 ms.
[2026-05-27 05:25:59] [INFO ] Time to serialize gal into /tmp/LTLFireability5882435045644358059.gal : 10 ms
[2026-05-27 05:25:59] [INFO ] Time to serialize properties into /tmp/LTLFireability7057583367874021735.ltl : 3 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/LTLFireability5882435045644358059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7057583367874021735.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...276
Read 2 LTL properties
Checking formula 0 : !((G(F("(((((i14.u81.y_0>=1)&&(i8.u70.P_awaity_2>=1))||((i14.u81.y_0>=1)&&(i4.i1.u74.P_awaity_3>=1)))||(((i14.u81.y_0>=1)&&(i7.i1.u73....2639
Formula 0 simplified : FG!"(((((i14.u81.y_0>=1)&&(i8.u70.P_awaity_2>=1))||((i14.u81.y_0>=1)&&(i4.i1.u74.P_awaity_3>=1)))||(((i14.u81.y_0>=1)&&(i7.i1.u73.P_...2633
Compilation finished in 1617 ms.
Running link step : cd /tmp/ltsmin11136783528380967000;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11136783528380967000;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 288937 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11136783528380967000;'/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' '--ltl' '<>((LTLAPp1==true))' '--buchi-type=spotba'
LTSmin run took 285975 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1361463 ms.
BK_STOP 1779860136392
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107900380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;