About the Execution of ITS-Tools for GPPP-PT-C0100N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 447.779 | 202530.00 | 216187.00 | 537.30 | FTFFFFFFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074100316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is GPPP-PT-C0100N0000000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.6K Mar 7 11:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 7 11:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 7 11:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 11:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 10:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 11:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 7 11:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 11:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 11:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000000010-LTLFireability-00
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-01
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-02
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-03
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-04
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-05
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-06
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-07
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-08
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-09
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-10
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-11
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-12
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-13
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-14
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779714066042
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000000010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 13:01:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 13:01:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 13:01:07] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2026-05-25 13:01:07] [INFO ] Transformed 33 places.
[2026-05-25 13:01:07] [INFO ] Transformed 22 transitions.
[2026-05-25 13:01:07] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6002365362437247272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4553894321088158187.kers'
[2026-05-25 13:01:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6002365362437247272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4553894321088158187.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-25 13:01:07] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4553894321088158187.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 20/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 65 constraints, problems are : Problem set: 1 solved, 20 unsolved in 14849 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15391ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 15408ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1690389096595555418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6540304631162999151.kers'
[2026-05-25 13:01:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1690389096595555418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6540304631162999151.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 21 rows 27 cols 68 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 13:01:22] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6540304631162999151.kers
Total runtime 1 ms.
[2026-05-25 13:01:22] [INFO ] Implicit Places using invariants in 48 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 21/22 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 5 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-857689827718879250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17803669035815555448.kers'
[2026-05-25 13:01:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-857689827718879250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17803669035815555448.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 12 SingleSign rule and 8 generalized
[2026-05-25 13:01:23] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17803669035815555448.kers
Total runtime 1 ms.
[2026-05-25 13:01:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 13:01:23] [INFO ] Invariant cache hit.
[2026-05-25 13:01:23] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 31/33 places, 21/22 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15614 ms. Remains : 31/33 places, 21/22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2026-05-25 13:01:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 10283 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10557ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 10557ms
[2026-05-25 13:01:33] [INFO ] Invariant cache hit.
[2026-05-25 13:01:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 13:01:33] [INFO ] Invariant cache hit.
[2026-05-25 13:01:33] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 10618 ms. Remains : 31/31 places, 21/21 transitions.
Support contains 24 out of 31 places after structural reductions.
[2026-05-25 13:01:33] [INFO ] Flatten gal took : 17 ms
[2026-05-25 13:01:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 13:01:33] [INFO ] Input system was already deterministic with 21 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 1927 steps (3 resets) in 53 ms. (35 steps per ms) remains 0/19 properties
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 29 stabilizing places and 19 stable transitions
Graph (complete) has 74 edges and 31 vertex of which 29 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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((G(p1)||p0))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 72 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 28 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 27 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 26 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 23 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 21 transition count 14
Applied a total of 14 rules in 18 ms. Remains 21 /31 variables (removed 10) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3452844122148353865.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2186518880102703638.kers'
[2026-05-25 13:01:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3452844122148353865.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2186518880102703638.kers]
Normalized transition count is 13 out of 14 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 13 rows 18 cols 48 entries
Finished phase 1 with 9 SingleSign rule and 4 generalized
[2026-05-25 13:01:34] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2186518880102703638.kers
Total runtime 0 ms.
[2026-05-25 13:01:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 13/34 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 30 constraints, problems are : Problem set: 0 solved, 13 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 13/34 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 43 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4516 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4720ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 4721ms
[2026-05-25 13:01:39] [INFO ] Invariant cache hit.
[2026-05-25 13:01:39] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 13:01:39] [INFO ] Invariant cache hit.
[2026-05-25 13:01:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 13:01:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2026-05-25 13:01:39] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 14/21 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4814 ms. Remains : 21/31 places, 14/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-02
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 6 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-02 finished in 5112 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 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 72 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 27 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 26 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 26 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 25 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 22 transition count 14
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 20 transition count 13
Applied a total of 14 rules in 11 ms. Remains 20 /31 variables (removed 11) and now considering 13/21 (removed 8) transitions.
Running 12 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15631311060502607430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4641802454053525668.kers'
[2026-05-25 13:01:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15631311060502607430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4641802454053525668.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 12 rows 16 cols 40 entries
Finished phase 1 with 8 SingleSign rule and 4 generalized
[2026-05-25 13:01:39] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4641802454053525668.kers
Total runtime 0 ms.
[2026-05-25 13:01:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 12/32 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/33 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 29 constraints, problems are : Problem set: 0 solved, 12 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 12/32 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 41 constraints, problems are : Problem set: 0 solved, 12 unsolved in 8570 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8744ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 8744ms
[2026-05-25 13:01:48] [INFO ] Invariant cache hit.
[2026-05-25 13:01:48] [INFO ] Implicit Places using invariants in 35 ms returned [0, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/31 places, 13/21 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 15 transition count 11
Applied a total of 4 rules in 2 ms. Remains 15 /17 variables (removed 2) and now considering 11/13 (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-17416271940296237640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8617079643633158904.kers'
[2026-05-25 13:01:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17416271940296237640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8617079643633158904.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 10 rows 12 cols 33 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 13:01:48] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8617079643633158904.kers
Total runtime 0 ms.
[2026-05-25 13:01:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 13:01:48] [INFO ] Invariant cache hit.
[2026-05-25 13:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 13:01:48] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/31 places, 11/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8853 ms. Remains : 15/31 places, 11/21 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 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-03 finished in 8964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(F((p1||G(F(p2)))))))))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6184830343166800903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6587614899914275036.kers'
[2026-05-25 13:01:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6184830343166800903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6587614899914275036.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 12 SingleSign rule and 8 generalized
[2026-05-25 13:01:48] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6587614899914275036.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 8804 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9031ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 9032ms
[2026-05-25 13:01:57] [INFO ] Invariant cache hit.
[2026-05-25 13:01:57] [INFO ] Implicit Places using invariants in 32 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9067 ms. Remains : 29/31 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(F((p1||G(F(p2)))))))))))'
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-04
Product exploration explored 100000 steps with 10502 reset in 281 ms.
Stack based approach found an accepted trace after 56 steps with 6 reset with depth 9 and stack size 9 in 1 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-04 finished in 9653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0||(p1 U p2)))) U (p3||G(!p4))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 74 edges and 31 vertex of which 29 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 27 transition count 18
Applied a total of 3 rules in 6 ms. Remains 27 /31 variables (removed 4) and now considering 18/21 (removed 3) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13256328921267057624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3138463429676409350.kers'
[2026-05-25 13:01:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13256328921267057624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3138463429676409350.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 18 rows 21 cols 53 entries
Finished phase 1 with 13 SingleSign rule and 4 generalized
[2026-05-25 13:01:58] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3138463429676409350.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/45 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 37 constraints, problems are : Problem set: 0 solved, 17 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/45 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 54 constraints, problems are : Problem set: 0 solved, 17 unsolved in 8304 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8515ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 8516ms
[2026-05-25 13:02:06] [INFO ] Invariant cache hit.
[2026-05-25 13:02:06] [INFO ] Implicit Places using invariants in 35 ms returned [0, 17, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/31 places, 18/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 17
Applied a total of 2 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 17/18 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8914353680730162922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14729740835105670451.kers'
[2026-05-25 13:02:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8914353680730162922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14729740835105670451.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 17 rows 18 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-25 13:02:06] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14729740835105670451.kers
Total runtime 0 ms.
[2026-05-25 13:02:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 13:02:06] [INFO ] Invariant cache hit.
[2026-05-25 13:02:06] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/31 places, 17/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8629 ms. Remains : 23/31 places, 17/21 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 U p1)||p2))) U (p3||G(!p4))))'
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p3) p4), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-05
Stuttering criterion allowed to conclude after 391 steps with 0 reset in 4 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-05 finished in 8860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 72 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 27 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 26 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 26 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 25 transition count 16
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 2 with 2 rules applied. Total rules applied 8 place count 24 transition count 15
Applied a total of 8 rules in 5 ms. Remains 24 /31 variables (removed 7) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9642984218530015638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17168160815132026166.kers'
[2026-05-25 13:02:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9642984218530015638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17168160815132026166.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 14 rows 18 cols 44 entries
Finished phase 1 with 9 SingleSign rule and 5 generalized
[2026-05-25 13:02:06] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17168160815132026166.kers
Total runtime 0 ms.
[2026-05-25 13:02:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 20195ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20195ms
[2026-05-25 13:02:27] [INFO ] Invariant cache hit.
[2026-05-25 13:02:27] [INFO ] Implicit Places using invariants in 38 ms returned [0, 15, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 15/21 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 13
Applied a total of 4 rules in 5 ms. Remains 19 /21 variables (removed 2) and now considering 13/15 (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-608305351674123142.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9608028162277182857.kers'
[2026-05-25 13:02:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-608305351674123142.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9608028162277182857.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 12 rows 14 cols 37 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-25 13:02:27] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9608028162277182857.kers
Total runtime 0 ms.
[2026-05-25 13:02:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 13:02:27] [INFO ] Invariant cache hit.
[2026-05-25 13:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 13:02:27] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/31 places, 13/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20318 ms. Remains : 19/31 places, 13/21 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 37 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-06
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-06 finished in 20383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||((X(F(p1))||F(!p0)) U p2)))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 74 edges and 31 vertex of which 29 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 27 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 24 transition count 16
Applied a total of 8 rules in 5 ms. Remains 24 /31 variables (removed 7) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-329406627626964471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2594315842145057028.kers'
[2026-05-25 13:02:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-329406627626964471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2594315842145057028.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 16 rows 19 cols 49 entries
Finished phase 1 with 11 SingleSign rule and 4 generalized
[2026-05-25 13:02:27] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2594315842145057028.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/40 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/40 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 15792 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15967ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 15967ms
[2026-05-25 13:02:43] [INFO ] Invariant cache hit.
[2026-05-25 13:02:43] [INFO ] Implicit Places using invariants in 50 ms returned [0, 15, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 16/21 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 19 transition count 14
Applied a total of 4 rules in 1 ms. Remains 19 /21 variables (removed 2) and now considering 14/16 (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-2490403785386913429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14538545405088962486.kers'
[2026-05-25 13:02:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2490403785386913429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14538545405088962486.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 14 rows 15 cols 42 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-25 13:02:43] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14538545405088962486.kers
Total runtime 0 ms.
[2026-05-25 13:02:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 13:02:43] [INFO ] Invariant cache hit.
[2026-05-25 13:02:43] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/31 places, 14/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16081 ms. Remains : 19/31 places, 14/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((X(F(p1))||F(p0)) U p2)))'
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-07
Product exploration explored 100000 steps with 18397 reset in 112 ms.
Stack based approach found an accepted trace after 127 steps with 24 reset with depth 13 and stack size 13 in 1 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-07 finished in 16355 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)&&F(!p0)) U (p1 U (!p1 U p2)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7493493811889735685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8241155187820671090.kers'
[2026-05-25 13:02:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7493493811889735685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8241155187820671090.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 12 SingleSign rule and 8 generalized
[2026-05-25 13:02:43] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8241155187820671090.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 11936 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12164ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 12164ms
[2026-05-25 13:02:55] [INFO ] Invariant cache hit.
[2026-05-25 13:02:55] [INFO ] Implicit Places using invariants in 32 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12199 ms. Remains : 29/31 places, 21/21 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)&&F(!p0)) U (p1 U (!p1 U p2)))))'
Stuttering acceptance computed with spot in 377 ms :[p2, p2, true, p2, p2, (AND p0 p2), false, (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-08
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-08 finished in 12614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(X(X(X(p1))))) U G(p1)))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 13:02:56] [INFO ] Invariant cache hit.
[2026-05-25 13:02:56] [INFO ] Implicit Places using invariants in 37 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 30/31 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(X(X(X(p1))))) U G(p1)))'
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-09
Product exploration explored 100000 steps with 16720 reset in 88 ms.
Product exploration explored 100000 steps with 16680 reset in 165 ms.
Computed a total of 28 stabilizing places and 19 stable transitions
Graph (complete) has 67 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 7 factoid took 76 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 1127 steps (0 resets) in 11 ms. (93 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8668373778736825481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1448463719752861085.kers'
[2026-05-25 13:02:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8668373778736825481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1448463719752861085.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 25 cols 62 entries
Finished phase 1 with 15 SingleSign rule and 5 generalized
[2026-05-25 13:02:57] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1448463719752861085.kers
Total runtime 0 ms.
[2026-05-25 13:02:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 13:02:57] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-25 13:02:57] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-25 13:02:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:02:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 13:02:57] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 38 ms returned sat
[2026-05-25 13:02:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 13:02:57] [INFO ] Computed and/alt/rep : 20/40/20 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 13:02:57] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 585 ms.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2026-05-25 13:02:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 19625 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19842ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 19843ms
[2026-05-25 13:03:17] [INFO ] Invariant cache hit.
[2026-05-25 13:03:17] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 13:03:17] [INFO ] Invariant cache hit.
[2026-05-25 13:03:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 19917 ms. Remains : 30/30 places, 21/21 transitions.
Computed a total of 28 stabilizing places and 19 stable transitions
Graph (complete) has 67 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 7 factoid took 72 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 764 steps (0 resets) in 10 ms. (69 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
[2026-05-25 13:03:17] [INFO ] Invariant cache hit.
[2026-05-25 13:03:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 13:03:17] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-25 13:03:17] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-25 13:03:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:03:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 13:03:18] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 39 ms returned sat
[2026-05-25 13:03:18] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 13:03:18] [INFO ] Computed and/alt/rep : 20/40/20 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 13:03:18] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 579 ms.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16717 reset in 74 ms.
Product exploration explored 100000 steps with 16609 reset in 80 ms.
Spot run failed in 73 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin3977949354088907435
[2026-05-25 13:03:18] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3977949354088907435
Running compilation step : cd /tmp/ltsmin3977949354088907435;'/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 196 ms.
Running link step : cd /tmp/ltsmin3977949354088907435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3977949354088907435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10069455003508533969.hoa' '--buchi-type=spotba'
LTSmin run took 37 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-09 finished in 22796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(X(G(p1)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4081728195097641120.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5549529473762624233.kers'
[2026-05-25 13:03:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4081728195097641120.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5549529473762624233.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 12 SingleSign rule and 8 generalized
[2026-05-25 13:03:19] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5549529473762624233.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 11461 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11682ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 11682ms
[2026-05-25 13:03:30] [INFO ] Invariant cache hit.
[2026-05-25 13:03:30] [INFO ] Implicit Places using invariants in 42 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11726 ms. Remains : 30/31 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-11 finished in 11985 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 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 2 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 72 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 24 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 22 transition count 15
Applied a total of 10 rules in 5 ms. Remains 22 /31 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4445675689681130615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12643190687617468462.kers'
[2026-05-25 13:03:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4445675689681130615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12643190687617468462.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 14 rows 18 cols 44 entries
Finished phase 1 with 10 SingleSign rule and 4 generalized
[2026-05-25 13:03:31] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12643190687617468462.kers
Total runtime 1 ms.
[2026-05-25 13:03:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/36 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 31 constraints, problems are : Problem set: 0 solved, 14 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/36 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 45 constraints, problems are : Problem set: 0 solved, 14 unsolved in 7116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7307ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 7307ms
[2026-05-25 13:03:38] [INFO ] Invariant cache hit.
[2026-05-25 13:03:38] [INFO ] Implicit Places using invariants in 28 ms returned [0, 11, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/31 places, 15/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 14
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 2 with 2 rules applied. Total rules applied 4 place count 17 transition count 13
Applied a total of 4 rules in 2 ms. Remains 17 /19 variables (removed 2) and now considering 13/15 (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-13016914544946170677.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2304062066195991724.kers'
[2026-05-25 13:03:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13016914544946170677.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2304062066195991724.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 12 rows 14 cols 38 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-25 13:03:38] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2304062066195991724.kers
Total runtime 1 ms.
[2026-05-25 13:03:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 13:03:38] [INFO ] Invariant cache hit.
[2026-05-25 13:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 13:03:38] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/31 places, 13/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7398 ms. Remains : 17/31 places, 13/21 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 36 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-12
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-12 finished in 7457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X((p0||X(!p0)))&&(p1 U !p0)))))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1367330630036022080.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1884523741200605881.kers'
[2026-05-25 13:03:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1367330630036022080.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1884523741200605881.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 12 SingleSign rule and 8 generalized
[2026-05-25 13:03:38] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1884523741200605881.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 11906 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12129ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 12129ms
[2026-05-25 13:03:50] [INFO ] Invariant cache hit.
[2026-05-25 13:03:50] [INFO ] Implicit Places using invariants in 28 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12161 ms. Remains : 30/31 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X((p0||X(!p0)))&&(p1 U !p0)))))))'
Stuttering acceptance computed with spot in 139 ms :[p0, p0, p0, p0]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 58 ms.
Product exploration explored 100000 steps with 25000 reset in 72 ms.
Computed a total of 28 stabilizing places and 19 stable transitions
Graph (complete) has 71 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 966 steps (0 resets) in 6 ms. (138 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0, p0]
Knowledge-based reduction took 269 ms.
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0, p0]
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8996087351350183362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8647531015576933812.kers'
[2026-05-25 13:03:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8996087351350183362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8647531015576933812.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 25 cols 65 entries
Finished phase 1 with 15 SingleSign rule and 5 generalized
[2026-05-25 13:03:51] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8647531015576933812.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5721 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5916ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 5917ms
[2026-05-25 13:03:57] [INFO ] Invariant cache hit.
[2026-05-25 13:03:57] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 13:03:57] [INFO ] Invariant cache hit.
[2026-05-25 13:03:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5988 ms. Remains : 30/30 places, 21/21 transitions.
Computed a total of 28 stabilizing places and 19 stable transitions
Graph (complete) has 71 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 632 steps (0 resets) in 7 ms. (79 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, p0]
Knowledge-based reduction took 271 ms.
Stuttering acceptance computed with spot in 147 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 131 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 25000 reset in 57 ms.
Product exploration explored 100000 steps with 25000 reset in 62 ms.
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2160541338751047090
[2026-05-25 13:03:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2160541338751047090
Running compilation step : cd /tmp/ltsmin2160541338751047090;'/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 93 ms.
Running link step : cd /tmp/ltsmin2160541338751047090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2160541338751047090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased12584397156779984441.hoa' '--buchi-type=spotba'
LTSmin run took 20 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-13 finished in 19768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&(p1||G(p2))))))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15945991879778089349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7049429932869640498.kers'
[2026-05-25 13:03:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15945991879778089349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7049429932869640498.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 12 SingleSign rule and 8 generalized
[2026-05-25 13:03:58] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7049429932869640498.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 9350 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9562ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 9562ms
[2026-05-25 13:04:07] [INFO ] Invariant cache hit.
[2026-05-25 13:04:07] [INFO ] Implicit Places using invariants in 29 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9595 ms. Remains : 29/31 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&(G(p1)||p2)))))))'
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-14
Stuttering criterion allowed to conclude after 425 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-14 finished in 9868 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(!p1) U p2)&&p0)))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 28 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 27 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 24 transition count 15
Applied a total of 10 rules in 4 ms. Remains 24 /31 variables (removed 7) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5785435520260121326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7608995036811179807.kers'
[2026-05-25 13:04:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5785435520260121326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7608995036811179807.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 14 rows 19 cols 46 entries
Finished phase 1 with 8 SingleSign rule and 6 generalized
[2026-05-25 13:04:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7608995036811179807.kers
Total runtime 0 ms.
[2026-05-25 13:04:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 38/39 variables, and 48 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20189ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20190ms
[2026-05-25 13:04:28] [INFO ] Invariant cache hit.
[2026-05-25 13:04:28] [INFO ] Implicit Places using invariants in 34 ms returned [0, 14, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 15/21 transitions.
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 2 place count 20 transition count 14
Applied a total of 2 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 14/15 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12377278122355792234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8430981727250225499.kers'
[2026-05-25 13:04:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12377278122355792234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8430981727250225499.kers]
Normalized transition count is 13 out of 14 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 13 rows 16 cols 42 entries
Finished phase 1 with 11 SingleSign rule and 2 generalized
[2026-05-25 13:04:28] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8430981727250225499.kers
Total runtime 0 ms.
[2026-05-25 13:04:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 13:04:28] [INFO ] Invariant cache hit.
[2026-05-25 13:04:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 13:04:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/31 places, 14/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20281 ms. Remains : 20/31 places, 14/21 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(!p1) U p2)&&p0)))'
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLFireability-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLFireability-15 finished in 20410 ms.
All properties solved by simple procedures.
Total runtime 201369 ms.
BK_STOP 1779714268572
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000000010"
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 GPPP-PT-C0100N0000000010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 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 ;