About the Execution of ITS-Tools for AutoFlight-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 852.896 | 338506.00 | 447476.00 | 621.10 | FFTFFFFFFFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366400532.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366400532
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.2K Mar 5 16:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 16:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 5 16:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 5 16:35 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 3.5K Mar 15 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Mar 5 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 5 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 134K 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 AutoFlight-PT-06b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779493031735
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 23:37:12] [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-22 23:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:37:13] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2026-05-22 23:37:13] [INFO ] Transformed 574 places.
[2026-05-22 23:37:13] [INFO ] Transformed 572 transitions.
[2026-05-22 23:37:13] [INFO ] Found NUPN structural information;
[2026-05-22 23:37:13] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-06b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 501 transition count 499
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 501 transition count 499
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 157 place count 501 transition count 488
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 188 place count 470 transition count 457
Iterating global reduction 1 with 31 rules applied. Total rules applied 219 place count 470 transition count 457
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 224 place count 465 transition count 452
Iterating global reduction 1 with 5 rules applied. Total rules applied 229 place count 465 transition count 452
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 233 place count 461 transition count 448
Iterating global reduction 1 with 4 rules applied. Total rules applied 237 place count 461 transition count 448
Applied a total of 237 rules in 140 ms. Remains 461 /574 variables (removed 113) and now considering 448/572 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2802250179074547649.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3613964587219011242.kers'
[2026-05-22 23:37:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2802250179074547649.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3613964587219011242.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 448 rows 461 cols 1086 entries
Finished phase 1 with 413 SingleSign rule and 8 generalized
[2026-05-22 23:37:13] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3613964587219011242.kers
Total runtime 4 ms.
[2026-05-22 23:37:13] [INFO ] Implicit Places using invariants in 392 ms returned []
[2026-05-22 23:37:13] [INFO ] Invariant cache hit.
[2026-05-22 23:37:14] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2026-05-22 23:37:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/461 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/909 variables, and 105 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/461 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/461 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 65/105 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 447 unsolved
SMT process timed out in 60176ms, After SMT, problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 461/574 places, 448/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61276 ms. Remains : 461/574 places, 448/572 transitions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Applied a total of 0 rules in 31 ms. Remains 461 /461 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2026-05-22 23:38:14] [INFO ] Invariant cache hit.
[2026-05-22 23:38:14] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-22 23:38:14] [INFO ] Invariant cache hit.
[2026-05-22 23:38:15] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 461/461 places, 448/448 transitions.
Support contains 43 out of 461 places after structural reductions.
[2026-05-22 23:38:15] [INFO ] Flatten gal took : 52 ms
[2026-05-22 23:38:15] [INFO ] Flatten gal took : 19 ms
[2026-05-22 23:38:15] [INFO ] Input system was already deterministic with 448 transitions.
Support contains 42 out of 461 places (down from 43) after GAL structural reductions.
RANDOM walk for 40000 steps (136 resets) in 1609 ms. (24 steps per ms) remains 8/36 properties
BEST_FIRST walk for 40004 steps (12 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (12 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (14 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
[2026-05-22 23:38:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 310/322 variables, 25/25 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 135/457 variables, 13/38 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 4/461 variables, 2/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 448/909 variables, 461/501 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/909 variables, 0/501 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/909 variables, 0/501 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 909/909 variables, and 501 constraints, problems are : Problem set: 1 solved, 7 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 461/461 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 313/322 variables, 25/25 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 6/31 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 135/457 variables, 13/44 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 2/46 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/461 variables, 2/48 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 3/51 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 448/909 variables, 461/512 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/909 variables, 6/518 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/909 variables, 1/519 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/909 variables, 0/519 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/909 variables, 0/519 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 909/909 variables, and 519 constraints, problems are : Problem set: 2 solved, 6 unsolved in 3303 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 461/461 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3845ms problems are : Problem set: 2 solved, 6 unsolved
Parikh walk visited 4 properties in 1536 ms.
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 448/448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 461 transition count 285
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 182 rules applied. Total rules applied 345 place count 298 transition count 266
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 357 place count 286 transition count 266
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 357 place count 286 transition count 211
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 467 place count 231 transition count 211
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 473 place count 225 transition count 205
Iterating global reduction 3 with 6 rules applied. Total rules applied 479 place count 225 transition count 205
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 479 place count 225 transition count 203
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 483 place count 223 transition count 203
Performed 86 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 655 place count 137 transition count 105
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 679 place count 137 transition count 81
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 703 place count 113 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 704 place count 112 transition count 80
Reduce places removed 28 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 4 with 69 rules applied. Total rules applied 773 place count 84 transition count 39
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 5 with 41 rules applied. Total rules applied 814 place count 43 transition count 39
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 814 place count 43 transition count 26
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 840 place count 30 transition count 26
Applied a total of 840 rules in 58 ms. Remains 30 /461 variables (removed 431) and now considering 26/448 (removed 422) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 30/461 places, 26/448 transitions.
RANDOM walk for 103 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/2 properties
FORMULA AutoFlight-PT-06b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA AutoFlight-PT-06b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 120 stabilizing places and 120 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(G(p0)))'
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 460 transition count 284
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 182 rules applied. Total rules applied 345 place count 297 transition count 265
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 357 place count 285 transition count 265
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 357 place count 285 transition count 209
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 469 place count 229 transition count 209
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 475 place count 223 transition count 203
Iterating global reduction 3 with 6 rules applied. Total rules applied 481 place count 223 transition count 203
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 481 place count 223 transition count 200
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 487 place count 220 transition count 200
Performed 84 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 655 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 656 place count 135 transition count 103
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 672 place count 124 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 677 place count 119 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 677 place count 119 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 689 place count 113 transition count 92
Applied a total of 689 rules in 35 ms. Remains 113 /461 variables (removed 348) and now considering 92/448 (removed 356) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17136939976938669472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17224855187586128657.kers'
[2026-05-22 23:38:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17136939976938669472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17224855187586128657.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 92 rows 103 cols 237 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-22 23:38:22] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17224855187586128657.kers
Total runtime 0 ms.
[2026-05-22 23:38:22] [INFO ] Implicit Places using invariants in 96 ms returned [46, 66, 86, 90, 94, 99, 103, 107, 112]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 97 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/461 places, 92/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 85
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 93 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 92 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 92 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 91 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 91 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 90 transition count 78
Applied a total of 28 rules in 19 ms. Remains 90 /104 variables (removed 14) and now considering 78/92 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1945350362190502307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2236202457841187393.kers'
[2026-05-22 23:38:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1945350362190502307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2236202457841187393.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 78 rows 81 cols 193 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-22 23:38:22] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2236202457841187393.kers
Total runtime 1 ms.
[2026-05-22 23:38:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 23:38:22] [INFO ] Invariant cache hit.
[2026-05-22 23:38:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 23:38:22] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/461 places, 78/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 90/461 places, 78/448 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 202 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-00
Product exploration explored 100000 steps with 3776 reset in 211 ms.
Stack based approach found an accepted trace after 48317 steps with 1834 reset with depth 11 and stack size 11 in 94 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-00 finished in 1045 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(((F(p0) U p1)||X((F(p0)&&(F(p2) U p3))))))'
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 453 transition count 440
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 453 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 453 transition count 439
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 450 transition count 436
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 450 transition count 436
Applied a total of 23 rules in 42 ms. Remains 450 /461 variables (removed 11) and now considering 436/448 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3090888940614773969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12701979378700119068.kers'
[2026-05-22 23:38:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3090888940614773969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12701979378700119068.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 436 rows 450 cols 1062 entries
Finished phase 1 with 402 SingleSign rule and 8 generalized
[2026-05-22 23:38:23] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12701979378700119068.kers
Total runtime 2 ms.
[2026-05-22 23:38:23] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-22 23:38:23] [INFO ] Invariant cache hit.
[2026-05-22 23:38:24] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2026-05-22 23:38:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/886 variables, and 120 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/450 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 80/120 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 14/168 constraints. Problems are: Problem set: 0 solved, 435 unsolved
SMT process timed out in 60197ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 450/461 places, 436/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60807 ms. Remains : 450/461 places, 436/448 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)||X((F(p0)&&(F(p2) U p3))))))'
Stuttering acceptance computed with spot in 306 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-01
Stuttering criterion allowed to conclude after 287 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-01 finished in 61185 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(X(X(p1)))||G(p2)))))'
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 453 transition count 440
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 453 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 453 transition count 439
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 449 transition count 435
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 449 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 448 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 448 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 447 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 447 transition count 433
Applied a total of 29 rules in 38 ms. Remains 447 /461 variables (removed 14) and now considering 433/448 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4179933520120802792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9174466783058518799.kers'
[2026-05-22 23:39:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4179933520120802792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9174466783058518799.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 433 rows 447 cols 1056 entries
Finished phase 1 with 399 SingleSign rule and 8 generalized
[2026-05-22 23:39:24] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9174466783058518799.kers
Total runtime 2 ms.
[2026-05-22 23:39:24] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-22 23:39:24] [INFO ] Invariant cache hit.
[2026-05-22 23:39:25] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2026-05-22 23:39:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/880 variables, and 115 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 75/115 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 11/186 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/880 variables, and 189 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 0/432 constraints, Known Traps: 149/149 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 447/461 places, 433/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60672 ms. Remains : 447/461 places, 433/448 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(X(X(p1)))||G(p2)))))'
Stuttering acceptance computed with spot in 391 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 197 ms.
Product exploration explored 100000 steps with 33333 reset in 164 ms.
Computed a total of 109 stabilizing places and 109 stable transitions
Computed a total of 109 stabilizing places and 109 stable transitions
Detected a total of 109/447 stabilizing places and 109/433 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 13 ms. Proved property starting from automaton with 11 states, 16 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 30 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06b-LTLFireability-02 finished in 61495 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((F(p0)&&F(p1)&&X((p2||G(p3))))))'
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 454 transition count 441
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 454 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 454 transition count 440
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 451 transition count 437
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 451 transition count 437
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 450 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 449 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 449 transition count 435
Applied a total of 25 rules in 47 ms. Remains 449 /461 variables (removed 12) and now considering 435/448 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12605922806051609471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4619902992855553561.kers'
[2026-05-22 23:40:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12605922806051609471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4619902992855553561.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 435 rows 449 cols 1060 entries
Finished phase 1 with 401 SingleSign rule and 8 generalized
[2026-05-22 23:40:26] [INFO ] Computed 40 invariants in 2 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4619902992855553561.kers
Total runtime 3 ms.
[2026-05-22 23:40:26] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-22 23:40:26] [INFO ] Invariant cache hit.
[2026-05-22 23:40:26] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2026-05-22 23:40:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/884 variables, and 112 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 72/112 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/884 variables, and 150 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 110/110 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LTL mode, iteration 1 : 449/461 places, 435/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60675 ms. Remains : 449/461 places, 435/448 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((F(p0)&&F(p1)&&X((p2||G(p3))))))'
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-04
Product exploration explored 100000 steps with 2577 reset in 144 ms.
Product exploration explored 100000 steps with 2563 reset in 142 ms.
Computed a total of 109 stabilizing places and 109 stable transitions
Computed a total of 109 stabilizing places and 109 stable transitions
Detected a total of 109/449 stabilizing places and 109/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 27 factoid took 122 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 288 steps (0 resets) in 5 ms. (48 steps per ms) remains 0/1 properties
Knowledge based reduction with 27 factoid took 57 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 50 ms :[(NOT p1), (NOT p1)]
[2026-05-22 23:41:27] [INFO ] Invariant cache hit.
[2026-05-22 23:41:27] [INFO ] [Real]Absence check using 38 positive place invariants in 17 ms returned sat
[2026-05-22 23:41:27] [INFO ] [Real]Absence check using 38 positive and 2 generalized place invariants in 16 ms returned sat
[2026-05-22 23:41:28] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2026-05-22 23:41:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:41:28] [INFO ] [Nat]Absence check using 38 positive place invariants in 16 ms returned sat
[2026-05-22 23:41:28] [INFO ] [Nat]Absence check using 38 positive and 2 generalized place invariants in 10 ms returned sat
[2026-05-22 23:41:29] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2026-05-22 23:41:29] [INFO ] Computed and/alt/rep : 434/618/434 causal constraints (skipped 0 transitions) in 28 ms.
[2026-05-22 23:41:34] [INFO ] Added : 428 causal constraints over 86 iterations in 5058 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 7123 ms.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 449 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 : 449/449 places, 435/435 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 155 place count 448 transition count 279
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 173 rules applied. Total rules applied 328 place count 293 transition count 261
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 341 place count 281 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 342 place count 280 transition count 260
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 342 place count 280 transition count 205
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 452 place count 225 transition count 205
Performed 85 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 622 place count 140 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 623 place count 139 transition count 107
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 632 place count 133 transition count 104
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 635 place count 130 transition count 104
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 635 place count 130 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 641 place count 127 transition count 101
Applied a total of 641 rules in 48 ms. Remains 127 /449 variables (removed 322) and now considering 101/435 (removed 334) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18337984045852058964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10081951826708929107.kers'
[2026-05-22 23:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18337984045852058964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10081951826708929107.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 101 rows 121 cols 286 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-22 23:41:34] [INFO ] Computed 34 invariants in 2 ms
Computed 34 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10081951826708929107.kers
Total runtime 3 ms.
[2026-05-22 23:41:34] [INFO ] Implicit Places using invariants in 72 ms returned [52, 72, 92, 98, 104, 117, 121, 126]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 86 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/449 places, 101/435 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 113 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 113 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 112 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 112 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 110 transition count 92
Applied a total of 18 rules in 7 ms. Remains 110 /119 variables (removed 9) and now considering 92/101 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15248246769887396230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6982454126384494754.kers'
[2026-05-22 23:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15248246769887396230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6982454126384494754.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 92 rows 105 cols 254 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-22 23:41:34] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6982454126384494754.kers
Total runtime 0 ms.
[2026-05-22 23:41:34] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 23:41:34] [INFO ] Invariant cache hit.
[2026-05-22 23:41:34] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-22 23:41:34] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [46, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 179 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/449 places, 92/435 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 108 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 90
Applied a total of 4 rules in 6 ms. Remains 106 /108 variables (removed 2) and now considering 90/92 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15432850705085625622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6810301357340151554.kers'
[2026-05-22 23:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15432850705085625622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6810301357340151554.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 90 rows 103 cols 250 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-22 23:41:34] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6810301357340151554.kers
Total runtime 1 ms.
[2026-05-22 23:41:35] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-22 23:41:35] [INFO ] Invariant cache hit.
[2026-05-22 23:41:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-22 23:41:35] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 106/449 places, 90/435 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 608 ms. Remains : 106/449 places, 90/435 transitions.
Computed a total of 8 stabilizing places and 4 stable transitions
Computed a total of 8 stabilizing places and 4 stable transitions
Detected a total of 8/106 stabilizing places and 4/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 85 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 59 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 93 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 50 ms :[(NOT p1), (NOT p1)]
[2026-05-22 23:41:35] [INFO ] Invariant cache hit.
[2026-05-22 23:41:35] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2026-05-22 23:41:35] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-22 23:41:35] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-22 23:41:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:41:35] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2026-05-22 23:41:35] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-22 23:41:35] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2026-05-22 23:41:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-22 23:41:35] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2026-05-22 23:41:35] [INFO ] Computed and/alt/rep : 81/205/81 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-22 23:41:35] [INFO ] Added : 55 causal constraints over 11 iterations in 91 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 535 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16154 reset in 117 ms.
Stack based approach found an accepted trace after 8502 steps with 1269 reset with depth 13 and stack size 13 in 11 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-04 finished in 69958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p0)||G(p1))))))'
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 452 transition count 439
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 452 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 452 transition count 438
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 448 transition count 434
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 448 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 447 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 447 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 446 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 446 transition count 432
Applied a total of 31 rules in 66 ms. Remains 446 /461 variables (removed 15) and now considering 432/448 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7668846887088682244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17033684885165965371.kers'
[2026-05-22 23:41:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7668846887088682244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17033684885165965371.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 446 cols 1054 entries
Finished phase 1 with 398 SingleSign rule and 8 generalized
[2026-05-22 23:41:36] [INFO ] Computed 40 invariants in 14 ms
Computed 40 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-17033684885165965371.kers
Total runtime 15 ms.
[2026-05-22 23:41:36] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-22 23:41:36] [INFO ] Invariant cache hit.
[2026-05-22 23:41:36] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2026-05-22 23:41:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 431 unsolved
SMT process timed out in 30133ms, After SMT, problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 30134ms
Starting structural reductions in LTL mode, iteration 1 : 446/461 places, 432/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30771 ms. Remains : 446/461 places, 432/448 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p0)||G(p1))))))'
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-05
Stuttering criterion allowed to conclude after 285 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-05 finished in 30924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&F((G(F((G(F(!p2))||(p3&&F(!p2)))))||(!p2&&F((G(F(!p2))||(p3&&F(!p2)))))))))'
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 460 transition count 289
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 177 rules applied. Total rules applied 335 place count 302 transition count 270
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 349 place count 290 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 351 place count 288 transition count 268
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 351 place count 288 transition count 214
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 459 place count 234 transition count 214
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 466 place count 227 transition count 207
Iterating global reduction 4 with 7 rules applied. Total rules applied 473 place count 227 transition count 207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 473 place count 227 transition count 204
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 479 place count 224 transition count 204
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 647 place count 140 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 648 place count 140 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 649 place count 139 transition count 107
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 16 rules applied. Total rules applied 665 place count 128 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 670 place count 123 transition count 102
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 670 place count 123 transition count 96
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 682 place count 117 transition count 96
Applied a total of 682 rules in 36 ms. Remains 117 /461 variables (removed 344) and now considering 96/448 (removed 352) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14576957936409171062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3233479957130050343.kers'
[2026-05-22 23:42:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14576957936409171062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3233479957130050343.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 96 rows 107 cols 249 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-22 23:42:07] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3233479957130050343.kers
Total runtime 0 ms.
[2026-05-22 23:42:07] [INFO ] Implicit Places using invariants in 128 ms returned [49, 69, 89, 93, 97, 102, 107, 111, 116]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 133 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/461 places, 96/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 101 transition count 89
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 101 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 100 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 100 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 99 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 99 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 98 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 98 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 97 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 95 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 94 transition count 82
Applied a total of 28 rules in 11 ms. Remains 94 /108 variables (removed 14) and now considering 82/96 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18372347956432346290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13417231268811105552.kers'
[2026-05-22 23:42:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18372347956432346290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13417231268811105552.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 82 rows 85 cols 205 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-22 23:42:07] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13417231268811105552.kers
Total runtime 1 ms.
[2026-05-22 23:42:07] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-22 23:42:07] [INFO ] Invariant cache hit.
[2026-05-22 23:42:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:42:07] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/461 places, 82/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 302 ms. Remains : 94/461 places, 82/448 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&F((G(F((G(F(p2))||(p3&&F(p2)))))||(p2&&F((G(F(p2))||(p3&&F(p2)))))))))'
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), false, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-07
Stuttering criterion allowed to conclude after 1646 steps with 116 reset in 7 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-07 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (p1&&G((p2||F(p3))))) U G(p4)))'
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 460 transition count 290
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 176 rules applied. Total rules applied 333 place count 303 transition count 271
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 347 place count 291 transition count 269
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 349 place count 289 transition count 269
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 349 place count 289 transition count 212
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 463 place count 232 transition count 212
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 469 place count 226 transition count 206
Iterating global reduction 4 with 6 rules applied. Total rules applied 475 place count 226 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 475 place count 226 transition count 204
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 479 place count 224 transition count 204
Performed 79 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 637 place count 145 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 638 place count 145 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 640 place count 144 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 641 place count 143 transition count 111
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 16 rules applied. Total rules applied 657 place count 132 transition count 106
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 662 place count 127 transition count 106
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 662 place count 127 transition count 100
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 674 place count 121 transition count 100
Applied a total of 674 rules in 47 ms. Remains 121 /461 variables (removed 340) and now considering 100/448 (removed 348) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8979372976894910927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18113902062941809025.kers'
[2026-05-22 23:42:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8979372976894910927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18113902062941809025.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 100 rows 110 cols 258 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-22 23:42:07] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18113902062941809025.kers
Total runtime 0 ms.
[2026-05-22 23:42:07] [INFO ] Implicit Places using invariants in 62 ms returned [115, 120]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/461 places, 100/448 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 111 transition count 92
Applied a total of 16 rules in 3 ms. Remains 111 /119 variables (removed 8) and now considering 92/100 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-627657348306860090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7793440990240963778.kers'
[2026-05-22 23:42:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-627657348306860090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7793440990240963778.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 92 rows 101 cols 240 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-22 23:42:07] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7793440990240963778.kers
Total runtime 0 ms.
[2026-05-22 23:42:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-22 23:42:07] [INFO ] Invariant cache hit.
[2026-05-22 23:42:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 23:42:07] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/461 places, 92/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 111/461 places, 92/448 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (p1&&G((p2||F(p3))))) U G(p4)))'
Stuttering acceptance computed with spot in 387 ms :[(NOT p4), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p4) p1), (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-09
Stuttering criterion allowed to conclude after 55 steps with 12 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-09 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 452 transition count 439
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 452 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 452 transition count 438
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 448 transition count 434
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 448 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 447 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 447 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 446 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 446 transition count 432
Applied a total of 31 rules in 38 ms. Remains 446 /461 variables (removed 15) and now considering 432/448 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4804925391549702145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1221862388935197848.kers'
[2026-05-22 23:42:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4804925391549702145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1221862388935197848.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 446 cols 1054 entries
Finished phase 1 with 398 SingleSign rule and 8 generalized
[2026-05-22 23:42:08] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1221862388935197848.kers
Total runtime 2 ms.
[2026-05-22 23:42:08] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-22 23:42:08] [INFO ] Invariant cache hit.
[2026-05-22 23:42:08] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 446/461 places, 432/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 446/461 places, 432/448 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-10 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 460 transition count 287
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 179 rules applied. Total rules applied 339 place count 300 transition count 268
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 352 place count 288 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 353 place count 287 transition count 267
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 353 place count 287 transition count 211
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 465 place count 231 transition count 211
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 472 place count 224 transition count 204
Iterating global reduction 4 with 7 rules applied. Total rules applied 479 place count 224 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 479 place count 224 transition count 201
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 485 place count 221 transition count 201
Performed 83 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 651 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 652 place count 137 transition count 105
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 16 rules applied. Total rules applied 668 place count 126 transition count 100
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 673 place count 121 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 673 place count 121 transition count 94
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 685 place count 115 transition count 94
Applied a total of 685 rules in 37 ms. Remains 115 /461 variables (removed 346) and now considering 94/448 (removed 354) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9555245677232271761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5770633174853559391.kers'
[2026-05-22 23:42:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9555245677232271761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5770633174853559391.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 94 rows 101 cols 233 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-22 23:42:08] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5770633174853559391.kers
Total runtime 1 ms.
[2026-05-22 23:42:09] [INFO ] Implicit Places using invariants in 100 ms returned [101, 105, 109, 114]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 114 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/461 places, 94/448 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 92
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 103 transition count 86
Applied a total of 16 rules in 4 ms. Remains 103 /111 variables (removed 8) and now considering 86/94 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5787691632039627366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9241321867058896016.kers'
[2026-05-22 23:42:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5787691632039627366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9241321867058896016.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 86 rows 90 cols 211 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-22 23:42:09] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9241321867058896016.kers
Total runtime 0 ms.
[2026-05-22 23:42:09] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-22 23:42:09] [INFO ] Invariant cache hit.
[2026-05-22 23:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:42:09] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/461 places, 86/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 324 ms. Remains : 103/461 places, 86/448 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(p1)))))'
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-12
Product exploration explored 100000 steps with 4178 reset in 213 ms.
Product exploration explored 100000 steps with 4196 reset in 238 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/103 stabilizing places and 3/86 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 8 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1683 resets) in 257 ms. (155 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (105 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2026-05-22 23:42:09] [INFO ] Invariant cache hit.
[2026-05-22 23:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/59 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/121 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 68/189 variables, 44/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/59 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/121 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 68/189 variables, 44/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 19/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 4 ms.
Knowledge based reduction with 8 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 594 ms.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2026-05-22 23:42:10] [INFO ] Invariant cache hit.
[2026-05-22 23:42:10] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 23:42:10] [INFO ] Invariant cache hit.
[2026-05-22 23:42:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:42:10] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2026-05-22 23:42:10] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2026-05-22 23:42:10] [INFO ] Invariant cache hit.
[2026-05-22 23:42:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 86/189 variables, 103/129 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 131 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 86/189 variables, 103/129 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 58/188 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 189 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3503 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6570ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 6570ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6802 ms. Remains : 103/103 places, 86/86 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/103 stabilizing places and 3/86 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 8 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1680 resets) in 204 ms. (195 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (129 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (107 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (120 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
[2026-05-22 23:42:17] [INFO ] Invariant cache hit.
[2026-05-22 23:42:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/59 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/121 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 68/189 variables, 44/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 129 constraints, problems are : Problem set: 0 solved, 3 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/59 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/121 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 68/189 variables, 44/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 19/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 132 constraints, problems are : Problem set: 0 solved, 3 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 3 properties in 6 ms.
Knowledge based reduction with 8 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1017 ms.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4199 reset in 178 ms.
Product exploration explored 100000 steps with 4206 reset in 167 ms.
Built C files in :
/tmp/ltsmin18402609635644120255
[2026-05-22 23:42:18] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2026-05-22 23:42:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:42:18] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2026-05-22 23:42:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:42:18] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2026-05-22 23:42:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:42:18] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18402609635644120255
Running compilation step : cd /tmp/ltsmin18402609635644120255;'/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 366 ms.
Running link step : cd /tmp/ltsmin18402609635644120255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin18402609635644120255;'/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/stateBased9624310946837165205.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 86/86 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2026-05-22 23:42:33] [INFO ] Invariant cache hit.
[2026-05-22 23:42:33] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-22 23:42:33] [INFO ] Invariant cache hit.
[2026-05-22 23:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:42:34] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2026-05-22 23:42:34] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 103/103 places, 86/86 transitions.
Built C files in :
/tmp/ltsmin11112324718532777994
[2026-05-22 23:42:34] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2026-05-22 23:42:34] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:42:34] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2026-05-22 23:42:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:42:34] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2026-05-22 23:42:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:42:34] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11112324718532777994
Running compilation step : cd /tmp/ltsmin11112324718532777994;'/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 175 ms.
Running link step : cd /tmp/ltsmin11112324718532777994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin11112324718532777994;'/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/stateBased17613841234402157880.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 23:42:49] [INFO ] Flatten gal took : 5 ms
[2026-05-22 23:42:49] [INFO ] Flatten gal took : 4 ms
[2026-05-22 23:42:49] [INFO ] Time to serialize gal into /tmp/LTL5320164660729092723.gal : 2 ms
[2026-05-22 23:42:49] [INFO ] Time to serialize properties into /tmp/LTL10920602949178101153.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/LTL5320164660729092723.gal' '-t' 'CGAL' '-hoa' '/tmp/aut535325231208888135.hoa' '-atoms' '/tmp/LTL10920602949178101153.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10920602949178101153.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut535325231208888135.hoa
Reverse transition relation is NOT exact ! Due to transitions t69.t70.t71.t72.t73.t74.t75, t303.t299.t361.t300.t298.t32.t77.t438.t33, Intersection with re...231
Computing Next relation with stutter on 3712 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
22 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.249465,25900,1,0,267,52616,212,140,3010,38465,408
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-06b-LTLFireability-12 finished in 40522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 460 transition count 287
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 179 rules applied. Total rules applied 339 place count 300 transition count 268
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 352 place count 288 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 353 place count 287 transition count 267
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 353 place count 287 transition count 211
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 465 place count 231 transition count 211
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 472 place count 224 transition count 204
Iterating global reduction 4 with 7 rules applied. Total rules applied 479 place count 224 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 479 place count 224 transition count 201
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 485 place count 221 transition count 201
Performed 85 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 655 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 656 place count 135 transition count 103
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 16 rules applied. Total rules applied 672 place count 124 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 677 place count 119 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 677 place count 119 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 689 place count 113 transition count 92
Applied a total of 689 rules in 21 ms. Remains 113 /461 variables (removed 348) and now considering 92/448 (removed 356) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6759283048873812948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10267965392635647225.kers'
[2026-05-22 23:42:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6759283048873812948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10267965392635647225.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 225 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-22 23:42:49] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10267965392635647225.kers
Total runtime 1 ms.
[2026-05-22 23:42:49] [INFO ] Implicit Places using invariants in 93 ms returned [44, 64, 86, 90, 94, 99, 103, 107, 112]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 94 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/461 places, 92/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 85
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 93 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 92 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 92 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 91 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 91 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 90 transition count 78
Applied a total of 28 rules in 6 ms. Remains 90 /104 variables (removed 14) and now considering 78/92 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5129301087969976540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7811515520875926402.kers'
[2026-05-22 23:42:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5129301087969976540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7811515520875926402.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 78 rows 77 cols 181 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-22 23:42:49] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7811515520875926402.kers
Total runtime 0 ms.
[2026-05-22 23:42:49] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-22 23:42:49] [INFO ] Invariant cache hit.
[2026-05-22 23:42:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:42:49] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/461 places, 78/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 90/461 places, 78/448 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 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-13 finished in 335 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 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 448/448 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 460 transition count 284
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 182 rules applied. Total rules applied 345 place count 297 transition count 265
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 357 place count 285 transition count 265
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 357 place count 285 transition count 209
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 469 place count 229 transition count 209
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 476 place count 222 transition count 202
Iterating global reduction 3 with 7 rules applied. Total rules applied 483 place count 222 transition count 202
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 483 place count 222 transition count 199
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 489 place count 219 transition count 199
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 657 place count 135 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 658 place count 135 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 659 place count 134 transition count 102
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 16 rules applied. Total rules applied 675 place count 123 transition count 97
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 680 place count 118 transition count 97
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 680 place count 118 transition count 91
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 692 place count 112 transition count 91
Applied a total of 692 rules in 37 ms. Remains 112 /461 variables (removed 349) and now considering 91/448 (removed 357) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13785095704332166428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2369528999731766598.kers'
[2026-05-22 23:42:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13785095704332166428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2369528999731766598.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 91 rows 99 cols 227 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-22 23:42:49] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2369528999731766598.kers
Total runtime 1 ms.
[2026-05-22 23:42:49] [INFO ] Implicit Places using invariants in 127 ms returned [45, 65, 85, 89, 93, 98, 102, 106, 111]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 140 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/461 places, 91/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 93 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 92 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 92 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 91 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 91 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 90 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 90 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 89 transition count 77
Applied a total of 28 rules in 7 ms. Remains 89 /103 variables (removed 14) and now considering 77/91 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9931055085397393169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2910944877276548221.kers'
[2026-05-22 23:42:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9931055085397393169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2910944877276548221.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 77 rows 77 cols 183 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-22 23:42:49] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2910944877276548221.kers
Total runtime 0 ms.
[2026-05-22 23:42:50] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 23:42:50] [INFO ] Invariant cache hit.
[2026-05-22 23:42:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 23:42:50] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/461 places, 77/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 89/461 places, 77/448 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 27 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-14
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-14 finished in 416 ms.
All properties solved by simple procedures.
Total runtime 337290 ms.
BK_STOP 1779493370241
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="AutoFlight-PT-06b"
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 AutoFlight-PT-06b, 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 r002-oct2-177944366400532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b 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 ;
