About the Execution of ITS-Tools for NeoElection-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16209.355 | 3600000.00 | 5187660.00 | 673951.40 | FFFTFTFFTF?FTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r194-tall-177969913900187.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 NeoElection-COL-7, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969913900187
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.5K Mar 8 07:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 8 07:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 8 07:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 8 07:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Mar 16 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 16 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 8 07:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 8 07:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 8 07:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 8 07:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 108K 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 NeoElection-COL-7-LTLCardinality-00
FORMULA_NAME NeoElection-COL-7-LTLCardinality-01
FORMULA_NAME NeoElection-COL-7-LTLCardinality-02
FORMULA_NAME NeoElection-COL-7-LTLCardinality-03
FORMULA_NAME NeoElection-COL-7-LTLCardinality-04
FORMULA_NAME NeoElection-COL-7-LTLCardinality-05
FORMULA_NAME NeoElection-COL-7-LTLCardinality-06
FORMULA_NAME NeoElection-COL-7-LTLCardinality-07
FORMULA_NAME NeoElection-COL-7-LTLCardinality-08
FORMULA_NAME NeoElection-COL-7-LTLCardinality-09
FORMULA_NAME NeoElection-COL-7-LTLCardinality-10
FORMULA_NAME NeoElection-COL-7-LTLCardinality-11
FORMULA_NAME NeoElection-COL-7-LTLCardinality-12
FORMULA_NAME NeoElection-COL-7-LTLCardinality-13
FORMULA_NAME NeoElection-COL-7-LTLCardinality-14
FORMULA_NAME NeoElection-COL-7-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779729996843
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-05-25 17:26:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 17:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:26:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-25 17:26:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-25 17:26:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 585 ms
[2026-05-25 17:26:38] [INFO ] Detected 6 constant HL places corresponding to 3552 PT places.
[2026-05-25 17:26:38] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2026-05-25 17:26:38] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2026-05-25 17:26:38] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA NeoElection-COL-7-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-7-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40009 steps (954 resets) in 230 ms. (173 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40002 steps (136 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15646486944414987461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10748415687303095340.kers'
[2026-05-25 17:26:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15646486944414987461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10748415687303095340.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 14 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-25 17:26:39] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10748415687303095340.kers
Total runtime 0 ms.
[2026-05-25 17:26:39] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
[2026-05-25 17:26:39] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2026-05-25 17:26:39] [INFO ] Flatten gal took : 13 ms
FORMULA NeoElection-COL-7-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 17:26:39] [INFO ] Flatten gal took : 1 ms
Domain [M(8), POS(7), M(8)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 7)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2026-05-25 17:26:39] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 12460 transitions 70880 arcs in 170 ms.
[2026-05-25 17:26:39] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Deduced a syphon composed of 6688 places in 37 ms
Reduce places removed 6737 places and 11850 transitions.
Reduce places removed 8 places and 0 transitions.
Support contains 245 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 610/610 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 341 transition count 610
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 77 place count 306 transition count 295
Iterating global reduction 1 with 35 rules applied. Total rules applied 112 place count 306 transition count 295
Applied a total of 112 rules in 22 ms. Remains 306 /383 variables (removed 77) and now considering 295/610 (removed 315) transitions.
[2026-05-25 17:26:39] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16278167135808707349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15674957711495417999.kers'
[2026-05-25 17:26:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16278167135808707349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15674957711495417999.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 259 rows 300 cols 1043 entries
Finished phase 1 with 175 SingleSign rule and 69 generalized
[2026-05-25 17:26:39] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15674957711495417999.kers
Total runtime 5 ms.
[2026-05-25 17:26:39] [INFO ] Implicit Places using invariants in 207 ms returned [19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 217 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/383 places, 295/610 transitions.
Applied a total of 0 rules in 2 ms. Remains 257 /257 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 246 ms. Remains : 257/383 places, 295/610 transitions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Applied a total of 0 rules in 3 ms. Remains 257 /257 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2026-05-25 17:26:39] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-851840990134434923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4401182885263108433.kers'
[2026-05-25 17:26:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-851840990134434923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4401182885263108433.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 259 rows 251 cols 896 entries
Finished phase 1 with 244 SingleSign rule and 0 generalized
[2026-05-25 17:26:39] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4401182885263108433.kers
Total runtime 5 ms.
[2026-05-25 17:26:39] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 17:26:39] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
[2026-05-25 17:26:39] [INFO ] Invariant cache hit.
[2026-05-25 17:26:40] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-25 17:26:40] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-25 17:26:40] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
[2026-05-25 17:26:40] [INFO ] Invariant cache hit.
[2026-05-25 17:26:40] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 7/257 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Problem TDEAD48 is UNSAT
At refinement iteration 4 (OVERLAPS) 259/516 variables, 257/270 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 21/291 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 20/311 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 20/331 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 20/351 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 9/360 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 9/369 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 1/370 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 370 constraints, problems are : Problem set: 1 solved, 287 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 257/257 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 7/257 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 79/92 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 259/516 variables, 257/349 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 21/370 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 287/657 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/657 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/516 variables, 1/658 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 658 constraints, problems are : Problem set: 1 solved, 287 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 257/257 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 287/288 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 1 solved, 287 unsolved
Search for dead transitions found 1 dead transitions in 60208ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 257/257 places, 294/295 transitions.
Applied a total of 0 rules in 2 ms. Remains 257 /257 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60479 ms. Remains : 257/257 places, 294/295 transitions.
Support contains 245 out of 257 places after structural reductions.
[2026-05-25 17:27:40] [INFO ] Flatten gal took : 32 ms
[2026-05-25 17:27:40] [INFO ] Flatten gal took : 29 ms
[2026-05-25 17:27:40] [INFO ] Input system was already deterministic with 294 transitions.
RANDOM walk for 2253 steps (0 resets) in 61 ms. (36 steps per ms) remains 0/7 properties
Computed a total of 257 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 257 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 175 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 294/294 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 250 transition count 280
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 243 transition count 280
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 236 transition count 273
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 236 transition count 273
Applied a total of 28 rules in 24 ms. Remains 236 /257 variables (removed 21) and now considering 273/294 (removed 21) transitions.
[2026-05-25 17:27:40] [INFO ] Flow matrix only has 237 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18418685971688717633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4699737214866396563.kers'
[2026-05-25 17:27:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18418685971688717633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4699737214866396563.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 237 rows 230 cols 851 entries
Finished phase 1 with 222 SingleSign rule and 0 generalized
[2026-05-25 17:27:40] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4699737214866396563.kers
Total runtime 2 ms.
[2026-05-25 17:27:40] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 17:27:40] [INFO ] Flow matrix only has 237 transitions (discarded 36 similar events)
[2026-05-25 17:27:40] [INFO ] Invariant cache hit.
[2026-05-25 17:27:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-25 17:27:40] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2026-05-25 17:27:40] [INFO ] Redundant transitions in 13 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-25 17:27:40] [INFO ] Flow matrix only has 237 transitions (discarded 36 similar events)
[2026-05-25 17:27:40] [INFO ] Invariant cache hit.
[2026-05-25 17:27:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 7/236 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 237/473 variables, 236/251 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (OVERLAPS) 0/473 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 333 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 236/236 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 7/236 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 237/473 variables, 236/313 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 266/599 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 0/473 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 599 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 236/236 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in SI_LTL mode, iteration 1 : 236/257 places, 273/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60319 ms. Remains : 236/257 places, 273/294 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 189 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-01
Stuttering criterion allowed to conclude after 385 steps with 0 reset in 8 ms.
FORMULA NeoElection-COL-7-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLCardinality-01 finished in 60593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(F(p0)))))))'
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 294/294 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 220 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 220 transition count 242
Applied a total of 74 rules in 27 ms. Remains 220 /257 variables (removed 37) and now considering 242/294 (removed 52) transitions.
[2026-05-25 17:28:41] [INFO ] Flow matrix only has 206 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11518751103779159114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16551259439768583749.kers'
[2026-05-25 17:28:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11518751103779159114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16551259439768583749.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 206 rows 214 cols 729 entries
Finished phase 1 with 206 SingleSign rule and 0 generalized
[2026-05-25 17:28:41] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16551259439768583749.kers
Total runtime 1 ms.
[2026-05-25 17:28:41] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 17:28:41] [INFO ] Flow matrix only has 206 transitions (discarded 36 similar events)
[2026-05-25 17:28:41] [INFO ] Invariant cache hit.
[2026-05-25 17:28:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 17:28:41] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2026-05-25 17:28:41] [INFO ] Flow matrix only has 206 transitions (discarded 36 similar events)
[2026-05-25 17:28:41] [INFO ] Invariant cache hit.
[2026-05-25 17:28:41] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 7/220 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 206/426 variables, 220/235 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 15/295 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 300 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 220/220 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 7/220 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 206/426 variables, 220/295 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 235/535 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 535 constraints, problems are : Problem set: 0 solved, 235 unsolved in 27687 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 220/220 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57733ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 57734ms
Starting structural reductions in LTL mode, iteration 1 : 220/257 places, 242/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58036 ms. Remains : 220/257 places, 242/294 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(F(p0)))))))'
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-02
Product exploration explored 100000 steps with 2044 reset in 304 ms.
Product exploration explored 100000 steps with 2031 reset in 255 ms.
Computed a total of 220 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 220 transition count 242
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 168 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2026-05-25 17:29:40] [INFO ] Flow matrix only has 206 transitions (discarded 36 similar events)
[2026-05-25 17:29:40] [INFO ] Invariant cache hit.
Proved EG (NOT p0) asserting that LTL formula F !(NOT p0) is false.
Negative knowledge disproves property using: (F p0)
Knowledge-based reduction took 426 ms.
FORMULA NeoElection-COL-7-LTLCardinality-02 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-02 finished in 59218 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)) U p1)||F(!p0)))'
Support contains 56 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 294/294 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 257 transition count 287
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 250 transition count 287
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 44 place count 220 transition count 242
Iterating global reduction 0 with 30 rules applied. Total rules applied 74 place count 220 transition count 242
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 213 transition count 235
Applied a total of 88 rules in 38 ms. Remains 213 /257 variables (removed 44) and now considering 235/294 (removed 59) transitions.
[2026-05-25 17:29:40] [INFO ] Flow matrix only has 199 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4035249991829487832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16586181491205985216.kers'
[2026-05-25 17:29:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4035249991829487832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16586181491205985216.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 199 rows 207 cols 429 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-25 17:29:40] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16586181491205985216.kers
Total runtime 1 ms.
[2026-05-25 17:29:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 17:29:40] [INFO ] Flow matrix only has 199 transitions (discarded 36 similar events)
[2026-05-25 17:29:40] [INFO ] Invariant cache hit.
[2026-05-25 17:29:40] [INFO ] State equation strengthened by 143 read => feed constraints.
[2026-05-25 17:29:40] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2026-05-25 17:29:40] [INFO ] Redundant transitions in 8 ms returned []
Running 228 sub problems to find dead transitions.
[2026-05-25 17:29:40] [INFO ] Flow matrix only has 199 transitions (discarded 36 similar events)
[2026-05-25 17:29:40] [INFO ] Invariant cache hit.
[2026-05-25 17:29:40] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 7/213 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 199/412 variables, 213/231 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 143/374 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/412 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 374 constraints, problems are : Problem set: 0 solved, 228 unsolved in 10012 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 213/213 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 7/213 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 199/412 variables, 213/231 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 143/374 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 228/602 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/412 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 602 constraints, problems are : Problem set: 0 solved, 228 unsolved in 13309 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 213/213 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23338ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 23339ms
Starting structural reductions in SI_LTL mode, iteration 1 : 213/257 places, 235/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23757 ms. Remains : 213/257 places, 235/294 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)) U p1)||F(!p0)))'
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 213 stabilizing places and 235 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 213 transition count 235
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 12 ms. Proved property starting from automaton with 1 states, 1 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 83 ms.
FORMULA NeoElection-COL-7-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-03 finished in 24269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 294/294 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 227 transition count 249
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 227 transition count 249
Applied a total of 60 rules in 11 ms. Remains 227 /257 variables (removed 30) and now considering 249/294 (removed 45) transitions.
[2026-05-25 17:30:04] [INFO ] Flow matrix only has 213 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15862026169746983983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4937151669284091268.kers'
[2026-05-25 17:30:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15862026169746983983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4937151669284091268.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 213 rows 221 cols 743 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-25 17:30:04] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4937151669284091268.kers
Total runtime 1 ms.
[2026-05-25 17:30:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 17:30:04] [INFO ] Flow matrix only has 213 transitions (discarded 36 similar events)
[2026-05-25 17:30:04] [INFO ] Invariant cache hit.
[2026-05-25 17:30:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 17:30:04] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-25 17:30:04] [INFO ] Flow matrix only has 213 transitions (discarded 36 similar events)
[2026-05-25 17:30:04] [INFO ] Invariant cache hit.
[2026-05-25 17:30:04] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 7/227 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 213/440 variables, 227/243 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 16/304 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 15/319 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 326 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 7/227 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 80/94 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 213/440 variables, 227/321 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 242/568 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 569 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 227/257 places, 249/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60359 ms. Remains : 227/257 places, 249/294 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-7-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLCardinality-09 finished in 60623 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 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 294/294 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 250 transition count 280
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 243 transition count 280
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 51 place count 206 transition count 228
Iterating global reduction 0 with 37 rules applied. Total rules applied 88 place count 206 transition count 228
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 158 place count 171 transition count 193
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 165 place count 164 transition count 186
Applied a total of 165 rules in 34 ms. Remains 164 /257 variables (removed 93) and now considering 186/294 (removed 108) transitions.
[2026-05-25 17:31:05] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13156140748099513396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14438637300150841679.kers'
[2026-05-25 17:31:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13156140748099513396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14438637300150841679.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 150 rows 151 cols 425 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-25 17:31:05] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14438637300150841679.kers
Total runtime 1 ms.
[2026-05-25 17:31:05] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 17:31:05] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2026-05-25 17:31:05] [INFO ] Invariant cache hit.
[2026-05-25 17:31:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 17:31:05] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2026-05-25 17:31:05] [INFO ] Redundant transitions in 2 ms returned []
Running 179 sub problems to find dead transitions.
[2026-05-25 17:31:05] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2026-05-25 17:31:05] [INFO ] Invariant cache hit.
[2026-05-25 17:31:05] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 150/314 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 183 constraints, problems are : Problem set: 0 solved, 179 unsolved in 6325 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 150/314 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 179/362 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 362 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8410 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14756ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 14757ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/257 places, 186/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14994 ms. Remains : 164/257 places, 186/294 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 : NeoElection-COL-7-LTLCardinality-10
Product exploration explored 100000 steps with 306 reset in 438 ms.
Product exploration explored 100000 steps with 305 reset in 389 ms.
Computed a total of 164 stabilizing places and 186 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 186
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 51 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 1232 steps (0 resets) in 17 ms. (68 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2026-05-25 17:31:21] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2026-05-25 17:31:21] [INFO ] Invariant cache hit.
[2026-05-25 17:31:21] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2026-05-25 17:31:21] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-25 17:31:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:31:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2026-05-25 17:31:21] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2026-05-25 17:31:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 17:31:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 12 ms returned sat
[2026-05-25 17:31:21] [INFO ] Computed and/alt/rep : 179/366/143 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 17:31:22] [INFO ] Added : 128 causal constraints over 26 iterations in 466 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1053 ms.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 186/186 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-25 17:31:22] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2026-05-25 17:31:22] [INFO ] Invariant cache hit.
[2026-05-25 17:31:22] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 17:31:22] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2026-05-25 17:31:22] [INFO ] Invariant cache hit.
[2026-05-25 17:31:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 17:31:22] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2026-05-25 17:31:22] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 164/164 places, 186/186 transitions.
Computed a total of 164 stabilizing places and 186 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 186
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 38 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 1306 steps (0 resets) in 16 ms. (76 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 50 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2026-05-25 17:31:22] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2026-05-25 17:31:22] [INFO ] Invariant cache hit.
[2026-05-25 17:31:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2026-05-25 17:31:22] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-25 17:31:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:31:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2026-05-25 17:31:23] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-25 17:31:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 17:31:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 6 ms returned sat
[2026-05-25 17:31:23] [INFO ] Computed and/alt/rep : 179/366/143 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 17:31:23] [INFO ] Added : 128 causal constraints over 26 iterations in 465 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1011 ms.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 305 reset in 346 ms.
Product exploration explored 100000 steps with 306 reset in 365 ms.
Built C files in :
/tmp/ltsmin9563626488438603954
[2026-05-25 17:31:24] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2026-05-25 17:31:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:31:24] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2026-05-25 17:31:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:31:24] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2026-05-25 17:31:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:31:24] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9563626488438603954
Running compilation step : cd /tmp/ltsmin9563626488438603954;'/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 491 ms.
Running link step : cd /tmp/ltsmin9563626488438603954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9563626488438603954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased173471476896071750.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 186/186 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-25 17:31:39] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2026-05-25 17:31:39] [INFO ] Invariant cache hit.
[2026-05-25 17:31:39] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 17:31:39] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2026-05-25 17:31:39] [INFO ] Invariant cache hit.
[2026-05-25 17:31:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 17:31:39] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2026-05-25 17:31:39] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 164/164 places, 186/186 transitions.
Built C files in :
/tmp/ltsmin16710771852969705912
[2026-05-25 17:31:39] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2026-05-25 17:31:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:31:39] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2026-05-25 17:31:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:31:39] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2026-05-25 17:31:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:31:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16710771852969705912
Running compilation step : cd /tmp/ltsmin16710771852969705912;'/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 389 ms.
Running link step : cd /tmp/ltsmin16710771852969705912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16710771852969705912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9006782144138902730.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 17:31:54] [INFO ] Flatten gal took : 14 ms
[2026-05-25 17:31:54] [INFO ] Flatten gal took : 11 ms
[2026-05-25 17:31:54] [INFO ] Time to serialize gal into /tmp/LTL12127180108906254339.gal : 4 ms
[2026-05-25 17:31:54] [INFO ] Time to serialize properties into /tmp/LTL4483085207580472982.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12127180108906254339.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17876871694963893174.hoa' '-atoms' '/tmp/LTL4483085207580472982.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4483085207580472982.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17876871694963893174.hoa
Detected timeout of ITS tools.
[2026-05-25 17:32:09] [INFO ] Flatten gal took : 12 ms
[2026-05-25 17:32:09] [INFO ] Flatten gal took : 12 ms
[2026-05-25 17:32:09] [INFO ] Time to serialize gal into /tmp/LTL12267205629843092484.gal : 8 ms
[2026-05-25 17:32:09] [INFO ] Time to serialize properties into /tmp/LTL14567501030353361600.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12267205629843092484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14567501030353361600.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("((((P_poll__handlingMessage_1+P_poll__handlingMessage_2)+(P_poll__handlingMessage_3+P_poll__handlingMessage_4))+((P_poll__handli...229
Formula 0 simplified : G!"((((P_poll__handlingMessage_1+P_poll__handlingMessage_2)+(P_poll__handlingMessage_3+P_poll__handlingMessage_4))+((P_poll__handlin...225
Detected timeout of ITS tools.
[2026-05-25 17:32:24] [INFO ] Flatten gal took : 14 ms
[2026-05-25 17:32:24] [INFO ] Applying decomposition
[2026-05-25 17:32:24] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10706122335215575136.txt' '-o' '/tmp/graph10706122335215575136.bin' '-w' '/tmp/graph10706122335215575136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10706122335215575136.bin' '-l' '-1' '-v' '-w' '/tmp/graph10706122335215575136.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:32:24] [INFO ] Decomposing Gal with order
[2026-05-25 17:32:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:32:24] [INFO ] Removed a total of 379 redundant transitions.
[2026-05-25 17:32:24] [INFO ] Flatten gal took : 51 ms
[2026-05-25 17:32:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 207 labels/synchronizations in 23 ms.
[2026-05-25 17:32:25] [INFO ] Time to serialize gal into /tmp/LTL829544613832960391.gal : 4 ms
[2026-05-25 17:32:25] [INFO ] Time to serialize properties into /tmp/LTL6099799843936545876.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL829544613832960391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6099799843936545876.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F("((((gu42.P_poll__handlingMessage_1+gu42.P_poll__handlingMessage_2)+(gu42.P_poll__handlingMessage_3+gu42.P_poll__handlingMessage_...264
Formula 0 simplified : G!"((((gu42.P_poll__handlingMessage_1+gu42.P_poll__handlingMessage_2)+(gu42.P_poll__handlingMessage_3+gu42.P_poll__handlingMessage_4...260
Detected timeout of ITS tools.
Treatment of property NeoElection-COL-7-LTLCardinality-10 finished in 94815 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 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 294/294 transitions.
Reduce places removed 7 places and 7 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 213 transition count 235
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 213 transition count 235
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 144 place count 178 transition count 200
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 151 place count 171 transition count 193
Applied a total of 151 rules in 24 ms. Remains 171 /257 variables (removed 86) and now considering 193/294 (removed 101) transitions.
[2026-05-25 17:32:40] [INFO ] Flow matrix only has 157 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11017818861556815332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12464657325466765219.kers'
[2026-05-25 17:32:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11017818861556815332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12464657325466765219.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 157 rows 165 cols 589 entries
Finished phase 1 with 157 SingleSign rule and 0 generalized
[2026-05-25 17:32:40] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12464657325466765219.kers
Total runtime 1 ms.
[2026-05-25 17:32:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 17:32:40] [INFO ] Flow matrix only has 157 transitions (discarded 36 similar events)
[2026-05-25 17:32:40] [INFO ] Invariant cache hit.
[2026-05-25 17:32:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 17:32:40] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2026-05-25 17:32:40] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2026-05-25 17:32:40] [INFO ] Flow matrix only has 157 transitions (discarded 36 similar events)
[2026-05-25 17:32:40] [INFO ] Invariant cache hit.
[2026-05-25 17:32:40] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 7/171 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 157/328 variables, 171/185 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 190 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7140 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 171/171 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 7/171 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 157/328 variables, 171/185 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 186/376 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 376 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8946 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 171/171 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16113ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/257 places, 193/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16380 ms. Remains : 171/257 places, 193/294 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 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-12
Product exploration explored 100000 steps with 816 reset in 328 ms.
Product exploration explored 100000 steps with 818 reset in 397 ms.
Computed a total of 171 stabilizing places and 193 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 171 transition count 193
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 12 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 72 ms.
FORMULA NeoElection-COL-7-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-12 finished in 17279 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))'
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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 17:32:57] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1536450218161314697
[2026-05-25 17:32:57] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2026-05-25 17:32:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:32:57] [INFO ] Applying decomposition
[2026-05-25 17:32:57] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2026-05-25 17:32:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:32:57] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2026-05-25 17:32:57] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:32:57] [INFO ] Flatten gal took : 30 ms
[2026-05-25 17:32:57] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1536450218161314697
Running compilation step : cd /tmp/ltsmin1536450218161314697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2208702715636860021.txt' '-o' '/tmp/graph2208702715636860021.bin' '-w' '/tmp/graph2208702715636860021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2208702715636860021.bin' '-l' '-1' '-v' '-w' '/tmp/graph2208702715636860021.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:32:57] [INFO ] Decomposing Gal with order
[2026-05-25 17:32:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:32:57] [INFO ] Removed a total of 393 redundant transitions.
[2026-05-25 17:32:57] [INFO ] Flatten gal took : 37 ms
[2026-05-25 17:32:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 17 ms.
[2026-05-25 17:32:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality554023930920343495.gal : 4 ms
[2026-05-25 17:32:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality1397067163512659023.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality554023930920343495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1397067163512659023.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((F("((((gu29.P_poll__handlingMessage_1+gu29.P_poll__handlingMessage_2)+(gu29.P_poll__handlingMessage_3+gu29.P_poll__handlingMessage_...264
Formula 0 simplified : G!"((((gu29.P_poll__handlingMessage_1+gu29.P_poll__handlingMessage_2)+(gu29.P_poll__handlingMessage_3+gu29.P_poll__handlingMessage_4...260
Compilation finished in 671 ms.
Running link step : cd /tmp/ltsmin1536450218161314697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1536450218161314697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 17:55:06] [INFO ] Applying decomposition
[2026-05-25 17:55:06] [INFO ] Flatten gal took : 157 ms
[2026-05-25 17:55:06] [INFO ] Decomposing Gal with order
[2026-05-25 17:55:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:55:07] [INFO ] Removed a total of 419 redundant transitions.
[2026-05-25 17:55:07] [INFO ] Flatten gal took : 130 ms
[2026-05-25 17:55:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2026-05-25 17:55:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality1495393747751183975.gal : 27 ms
[2026-05-25 17:55:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality16196210981060751219.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1495393747751183975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16196210981060751219.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F("((((gM1.P_poll__handlingMessage_1+gM2.P_poll__handlingMessage_2)+(gM3.P_poll__handlingMessage_3+gM4.P_poll__handlingMessage_4))+...257
Formula 0 simplified : G!"((((gM1.P_poll__handlingMessage_1+gM2.P_poll__handlingMessage_2)+(gM3.P_poll__handlingMessage_3+gM4.P_poll__handlingMessage_4))+(...253
Detected timeout of ITS tools.
[2026-05-25 18:17:22] [INFO ] Flatten gal took : 241 ms
[2026-05-25 18:17:22] [INFO ] Input system was already deterministic with 294 transitions.
[2026-05-25 18:17:22] [INFO ] Transformed 257 places.
[2026-05-25 18:17:22] [INFO ] Transformed 294 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 18:17:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality4583266007883148036.gal : 2 ms
[2026-05-25 18:17:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality5196035522624234961.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4583266007883148036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5196035522624234961.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("((((P_poll__handlingMessage_1+P_poll__handlingMessage_2)+(P_poll__handlingMessage_3+P_poll__handlingMessage_4))+((P_poll__handli...229
Formula 0 simplified : G!"((((P_poll__handlingMessage_1+P_poll__handlingMessage_2)+(P_poll__handlingMessage_3+P_poll__handlingMessage_4))+((P_poll__handlin...225
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-7"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-7, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969913900187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-7.tgz
mv NeoElection-COL-7 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;