About the Execution of ITS-Tools for FileSystem-PT-N03I10B08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9505.172 | 1460489.00 | 2373886.00 | 4736.60 | TTTFTFTFFFFFFFFT | 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.r338-smll-178021499300435.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 FileSystem-PT-N03I10B08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300435
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 8.2K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 16K May 27 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K May 27 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 27 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 191K Jun 10 11:57 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 FileSystem-PT-N03I10B08-LTLCardinality-00
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-01
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-02
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-03
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-04
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-05
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-06
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-07
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-08
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-09
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-10
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-11
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-12
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-13
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-14
FORMULA_NAME FileSystem-PT-N03I10B08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1781615530267
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N03I10B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-16 13:12:12] [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-06-16 13:12:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:12:13] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2026-06-16 13:12:13] [INFO ] Transformed 455 places.
[2026-06-16 13:12:13] [INFO ] Transformed 420 transitions.
[2026-06-16 13:12:13] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 420/420 transitions.
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 373 transition count 420
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 129 place count 316 transition count 363
Iterating global reduction 1 with 57 rules applied. Total rules applied 186 place count 316 transition count 363
Applied a total of 186 rules in 133 ms. Remains 316 /445 variables (removed 129) and now considering 363/420 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11991593090684001765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3994942303241809109.kers'
[2026-06-16 13:12:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11991593090684001765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3994942303241809109.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 363 rows 308 cols 1007 entries
Finished phase 1 with 298 SingleSign rule and 0 generalized
[2026-06-16 13:12:13] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3994942303241809109.kers
Total runtime 8 ms.
[2026-06-16 13:12:15] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2026-06-16 13:12:15] [INFO ] Invariant cache hit.
[2026-06-16 13:12:15] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:12:17] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 3470 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2026-06-16 13:12:17] [INFO ] Invariant cache hit.
[2026-06-16 13:12:17] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 11/308 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 353 unsolved
SMT process timed out in 30473ms, After SMT, problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 30504ms
Starting structural reductions in LTL mode, iteration 1 : 316/445 places, 363/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34188 ms. Remains : 316/445 places, 363/420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 363/363 transitions.
Applied a total of 0 rules in 17 ms. Remains 316 /316 variables (removed 0) and now considering 363/363 (removed 0) transitions.
[2026-06-16 13:12:47] [INFO ] Invariant cache hit.
[2026-06-16 13:12:48] [INFO ] Implicit Places using invariants in 669 ms returned []
[2026-06-16 13:12:48] [INFO ] Invariant cache hit.
[2026-06-16 13:12:48] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:12:50] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2185 ms. Remains : 316/316 places, 363/363 transitions.
Support contains 44 out of 316 places after structural reductions.
[2026-06-16 13:12:50] [INFO ] Flatten gal took : 121 ms
[2026-06-16 13:12:50] [INFO ] Flatten gal took : 61 ms
[2026-06-16 13:12:50] [INFO ] Input system was already deterministic with 363 transitions.
RANDOM walk for 40000 steps (8 resets) in 2321 ms. (17 steps per ms) remains 23/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 90 ms. (43 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 95 ms. (41 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
[2026-06-16 13:12:51] [INFO ] Invariant cache hit.
[2026-06-16 13:12:51] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 276/309 variables, 12/12 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/315 variables, 6/18 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/18 constraints. Problems are: Problem set: 7 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (OVERLAPS) 363/678 variables, 315/333 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 80/413 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 0/413 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/679 variables, 1/414 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/679 variables, 0/414 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/679 variables, 0/414 constraints. Problems are: Problem set: 14 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 679/679 variables, and 414 constraints, problems are : Problem set: 14 solved, 7 unsolved in 2075 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 316/316 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 287/300 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 12/20 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/20 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/310 variables, 10/30 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/30 constraints. Problems are: Problem set: 14 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 363/673 variables, 310/340 constraints. Problems are: Problem set: 14 solved, 7 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 80/420 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 6/426 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 0/426 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 6/679 variables, 6/432 constraints. Problems are: Problem set: 15 solved, 6 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/679 variables, and 432 constraints, problems are : Problem set: 15 solved, 6 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 316/316 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 6/21 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7125ms problems are : Problem set: 15 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 363/363 transitions.
Graph (complete) has 755 edges and 316 vertex of which 309 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 309 transition count 353
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 299 transition count 353
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 32 place count 288 transition count 342
Iterating global reduction 2 with 11 rules applied. Total rules applied 43 place count 288 transition count 342
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 209 place count 205 transition count 259
Free-agglomeration rule (complex) applied 75 times.
Iterating global reduction 2 with 75 rules applied. Total rules applied 284 place count 205 transition count 184
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 361 place count 128 transition count 184
Applied a total of 361 rules in 153 ms. Remains 128 /316 variables (removed 188) and now considering 184/363 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 128/316 places, 184/363 transitions.
RANDOM walk for 40000 steps (8 resets) in 934 ms. (42 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5649786711337053783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5967648680505864247.kers'
[2026-06-16 13:12:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5649786711337053783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5967648680505864247.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 184 rows 119 cols 490 entries
Finished phase 1 with 111 SingleSign rule and 1 generalized
[2026-06-16 13:12:59] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5967648680505864247.kers
Total runtime 3 ms.
[2026-06-16 13:12:59] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 102/116 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/127 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 184/311 variables, 127/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 80/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/312 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/312 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 224 constraints, problems are : Problem set: 0 solved, 3 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 102/116 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/127 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 184/311 variables, 127/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 80/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/312 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/312 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 232 constraints, problems are : Problem set: 0 solved, 3 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1302ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 107 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 184/184 transitions.
Graph (complete) has 471 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 126 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 183
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 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 117 transition count 176
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 117 transition count 173
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 113 transition count 173
Applied a total of 26 rules in 43 ms. Remains 113 /128 variables (removed 15) and now considering 173/184 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 113/128 places, 173/184 transitions.
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 113105 steps, run visited all 1 properties in 478 ms. (steps per millisecond=236 )
Probabilistic random walk after 113105 steps, saw 26827 distinct states, run finished after 486 ms. (steps per millisecond=232 ) properties seen :1
Successfully simplified 15 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 68 stabilizing places and 123 stable transitions
Graph (complete) has 763 edges and 316 vertex of which 308 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)))'
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 363/363 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 308 transition count 363
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 293 transition count 348
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 293 transition count 348
Applied a total of 38 rules in 17 ms. Remains 293 /316 variables (removed 23) and now considering 348/363 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2037221005296248056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4819084484512521927.kers'
[2026-06-16 13:13:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2037221005296248056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4819084484512521927.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 348 rows 285 cols 954 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-16 13:13:02] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4819084484512521927.kers
Total runtime 6 ms.
[2026-06-16 13:13:02] [INFO ] Implicit Places using invariants in 698 ms returned []
[2026-06-16 13:13:02] [INFO ] Invariant cache hit.
[2026-06-16 13:13:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:13:04] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2305 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-16 13:13:04] [INFO ] Invariant cache hit.
[2026-06-16 13:13:04] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/641 variables, and 51 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 11/293 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 26/51 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/641 variables, and 70 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/338 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Starting structural reductions in LTL mode, iteration 1 : 293/316 places, 348/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62539 ms. Remains : 293/316 places, 348/363 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)))'
Stuttering acceptance computed with spot in 398 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 489 ms.
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Computed a total of 45 stabilizing places and 108 stable transitions
Computed a total of 45 stabilizing places and 108 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 24 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 40 ms.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FileSystem-PT-N03I10B08-LTLCardinality-01 finished in 63931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X(X((p1||F(p2))))))))'
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 363/363 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 308 transition count 363
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 22 place count 294 transition count 349
Iterating global reduction 1 with 14 rules applied. Total rules applied 36 place count 294 transition count 349
Applied a total of 36 rules in 16 ms. Remains 294 /316 variables (removed 22) and now considering 349/363 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7665163750111670766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4887429308072127147.kers'
[2026-06-16 13:14:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7665163750111670766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4887429308072127147.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 286 cols 957 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-16 13:14:05] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4887429308072127147.kers
Total runtime 6 ms.
[2026-06-16 13:14:06] [INFO ] Implicit Places using invariants in 691 ms returned []
[2026-06-16 13:14:06] [INFO ] Invariant cache hit.
[2026-06-16 13:14:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:14:08] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-06-16 13:14:08] [INFO ] Invariant cache hit.
[2026-06-16 13:14:08] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 11/294 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 339 unsolved
SMT process timed out in 30377ms, After SMT, problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 30380ms
Starting structural reductions in LTL mode, iteration 1 : 294/316 places, 349/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32804 ms. Remains : 294/316 places, 349/363 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X(X((p1||F(p2))))))))'
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLCardinality-03
Product exploration explored 100000 steps with 19968 reset in 587 ms.
Product exploration explored 100000 steps with 19944 reset in 496 ms.
Computed a total of 46 stabilizing places and 109 stable transitions
Computed a total of 46 stabilizing places and 109 stable transitions
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 648 ms. (61 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
[2026-06-16 13:14:40] [INFO ] Invariant cache hit.
[2026-06-16 13:14:40] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 278/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/294 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 349/643 variables, 294/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 80/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/643 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 392 constraints, problems are : Problem set: 0 solved, 4 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 294/294 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 278/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/294 variables, 11/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 2/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 349/643 variables, 294/323 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 80/403 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 3/406 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/643 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 406 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3498 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 294/294 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4197ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 139 ms.
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 349/349 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 294 transition count 339
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 284 transition count 339
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 190 place count 199 transition count 254
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 270 place count 199 transition count 174
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 354 place count 115 transition count 174
Applied a total of 354 rules in 44 ms. Remains 115 /294 variables (removed 179) and now considering 174/349 (removed 175) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 115/294 places, 174/349 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 428050 steps, run visited all 3 properties in 2022 ms. (steps per millisecond=211 )
Probabilistic random walk after 428050 steps, saw 93167 distinct states, run finished after 2022 ms. (steps per millisecond=211 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 7353 ms.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 294 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 349/349 transitions.
Applied a total of 0 rules in 5 ms. Remains 294 /294 variables (removed 0) and now considering 349/349 (removed 0) transitions.
[2026-06-16 13:14:47] [INFO ] Invariant cache hit.
[2026-06-16 13:14:48] [INFO ] Implicit Places using invariants in 421 ms returned []
[2026-06-16 13:14:48] [INFO ] Invariant cache hit.
[2026-06-16 13:14:48] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:14:49] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1530 ms. Remains : 294/294 places, 349/349 transitions.
Computed a total of 46 stabilizing places and 109 stable transitions
Computed a total of 46 stabilizing places and 109 stable transitions
Knowledge based reduction with 1 factoid took 54 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 488635 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 3
Probabilistic random walk after 488635 steps, saw 128645 distinct states, run finished after 3007 ms. (steps per millisecond=162 ) properties seen :0
[2026-06-16 13:14:52] [INFO ] Invariant cache hit.
[2026-06-16 13:14:52] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 278/281 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/294 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 349/643 variables, 294/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 80/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/643 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 392 constraints, problems are : Problem set: 0 solved, 3 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 294/294 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 278/281 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 13/294 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 349/643 variables, 294/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 80/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/643 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 406 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2785 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 294/294 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3289ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 368 ms.
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 349/349 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 294 transition count 339
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 284 transition count 339
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 192 place count 198 transition count 253
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 272 place count 198 transition count 173
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 2 with 85 rules applied. Total rules applied 357 place count 113 transition count 173
Applied a total of 357 rules in 34 ms. Remains 113 /294 variables (removed 181) and now considering 173/349 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 113/294 places, 173/349 transitions.
RANDOM walk for 40000 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13523181879658849851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-269491087471293453.kers'
[2026-06-16 13:14:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13523181879658849851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-269491087471293453.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 173 rows 102 cols 436 entries
Finished phase 1 with 98 SingleSign rule and 2 generalized
[2026-06-16 13:14:56] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-269491087471293453.kers
Total runtime 1 ms.
[2026-06-16 13:14:56] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/105 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/113 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 173/286 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 80/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/286 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/105 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 8/113 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 173/286 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 80/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/286 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 840ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 113/113 places, 173/173 transitions.
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 427713 steps, run visited all 2 properties in 1493 ms. (steps per millisecond=286 )
Probabilistic random walk after 427713 steps, saw 93057 distinct states, run finished after 1493 ms. (steps per millisecond=286 ) properties seen :2
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 9606 ms.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 19987 reset in 180 ms.
Product exploration explored 100000 steps with 20014 reset in 217 ms.
Spot run failed in 126 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin857807668005752817
[2026-06-16 13:15:00] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin857807668005752817
Running compilation step : cd /tmp/ltsmin857807668005752817;'/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 1030 ms.
Running link step : cd /tmp/ltsmin857807668005752817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin857807668005752817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10661757095669738358.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 349/349 transitions.
Applied a total of 0 rules in 3 ms. Remains 294 /294 variables (removed 0) and now considering 349/349 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17838427014349851927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12444584023440709009.kers'
[2026-06-16 13:15:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17838427014349851927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12444584023440709009.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 286 cols 957 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-16 13:15:15] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12444584023440709009.kers
Total runtime 3 ms.
[2026-06-16 13:15:15] [INFO ] Implicit Places using invariants in 467 ms returned []
[2026-06-16 13:15:15] [INFO ] Invariant cache hit.
[2026-06-16 13:15:15] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:15:16] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1736 ms. Remains : 294/294 places, 349/349 transitions.
Built C files in :
/tmp/ltsmin16105603485889570543
[2026-06-16 13:15:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16105603485889570543
Running compilation step : cd /tmp/ltsmin16105603485889570543;'/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 788 ms.
Running link step : cd /tmp/ltsmin16105603485889570543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16105603485889570543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2719463451028328320.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-16 13:15:31] [INFO ] Flatten gal took : 28 ms
[2026-06-16 13:15:31] [INFO ] Flatten gal took : 27 ms
[2026-06-16 13:15:31] [INFO ] Time to serialize gal into /tmp/LTL16499863529898245625.gal : 9 ms
[2026-06-16 13:15:31] [INFO ] Time to serialize properties into /tmp/LTL133744261362719919.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/LTL16499863529898245625.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12060607095585860289.hoa' '-atoms' '/tmp/LTL133744261362719919.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL133744261362719919.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12060607095585860289.hoa
Detected timeout of ITS tools.
[2026-06-16 13:15:47] [INFO ] Flatten gal took : 23 ms
[2026-06-16 13:15:47] [INFO ] Flatten gal took : 23 ms
[2026-06-16 13:15:47] [INFO ] Time to serialize gal into /tmp/LTL15315541171324033470.gal : 7 ms
[2026-06-16 13:15:47] [INFO ] Time to serialize properties into /tmp/LTL12237639460810815629.ltl : 6 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/LTL15315541171324033470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12237639460810815629.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 : !((X(G((G("(busy_11_20>loop_6_18)"))U(X(X(("(endloop_8_11<=loop_5_13)")||(F("(loop_8_16>=1)")))))))))
Formula 0 simplified : XF(F!"(busy_11_20>loop_6_18)" R XX(!"(endloop_8_11<=loop_5_13)" & G!"(loop_8_16>=1)"))
Detected timeout of ITS tools.
[2026-06-16 13:16:02] [INFO ] Flatten gal took : 20 ms
[2026-06-16 13:16:02] [INFO ] Applying decomposition
[2026-06-16 13:16:02] [INFO ] Flatten gal took : 19 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/graph14296198214650566826.txt' '-o' '/tmp/graph14296198214650566826.bin' '-w' '/tmp/graph14296198214650566826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14296198214650566826.bin' '-l' '-1' '-v' '-w' '/tmp/graph14296198214650566826.weights' '-q' '0' '-e' '0.001'
[2026-06-16 13:16:02] [INFO ] Decomposing Gal with order
[2026-06-16 13:16:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 13:16:02] [INFO ] Removed a total of 315 redundant transitions.
[2026-06-16 13:16:02] [INFO ] Flatten gal took : 131 ms
[2026-06-16 13:16:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 30 ms.
[2026-06-16 13:16:02] [INFO ] Time to serialize gal into /tmp/LTL10139492171948575183.gal : 12 ms
[2026-06-16 13:16:02] [INFO ] Time to serialize properties into /tmp/LTL4543463369871866421.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10139492171948575183.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4543463369871866421.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(gu82.busy_11_20>gu82.loop_6_18)"))U(X(X(("(gu78.endloop_8_11<=gu78.loop_5_13)")||(F("(gi0.gi0.gi1.gu101.loop_8_16>=1)"))))...160
Formula 0 simplified : XF(F!"(gu82.busy_11_20>gu82.loop_6_18)" R XX(!"(gu78.endloop_8_11<=gu78.loop_5_13)" & G!"(gi0.gi0.gi1.gu101.loop_8_16>=1)"))
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N03I10B08-LTLCardinality-03 finished in 131827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 363/363 transitions.
Graph (complete) has 763 edges and 316 vertex of which 308 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 308 transition count 353
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 298 transition count 353
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 35 place count 284 transition count 339
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 284 transition count 339
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 223 place count 197 transition count 252
Applied a total of 223 rules in 33 ms. Remains 197 /316 variables (removed 119) and now considering 252/363 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17117305993819613405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9753613149714545454.kers'
[2026-06-16 13:16:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17117305993819613405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9753613149714545454.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 252 rows 189 cols 834 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-06-16 13:16:17] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9753613149714545454.kers
Total runtime 2 ms.
[2026-06-16 13:16:18] [INFO ] Implicit Places using invariants in 371 ms returned []
[2026-06-16 13:16:18] [INFO ] Invariant cache hit.
[2026-06-16 13:16:18] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:16:19] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2026-06-16 13:16:19] [INFO ] Redundant transitions in 13 ms returned []
Running 242 sub problems to find dead transitions.
[2026-06-16 13:16:19] [INFO ] Invariant cache hit.
[2026-06-16 13:16:19] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 252/449 variables, 197/246 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 80/326 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/449 variables, and 326 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 31/31 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/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 11/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 30/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 252/449 variables, 197/246 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 80/326 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 230/556 constraints. Problems are: Problem set: 12 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/449 variables, and 556 constraints, problems are : Problem set: 12 solved, 230 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 230/242 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 12 solved, 230 unsolved
Search for dead transitions found 12 dead transitions in 60074ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 197/316 places, 240/363 transitions.
Applied a total of 0 rules in 10 ms. Remains 197 /197 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2026-06-16 13:17:19] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61418 ms. Remains : 197/316 places, 240/363 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 135 ms.
Product exploration explored 100000 steps with 0 reset in 373 ms.
Computed a total of 28 stabilizing places and 79 stable transitions
Computed a total of 28 stabilizing places and 79 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 915880 steps, run visited all 1 properties in 2876 ms. (steps per millisecond=318 )
Probabilistic random walk after 915880 steps, saw 229684 distinct states, run finished after 2877 ms. (steps per millisecond=318 ) properties seen :1
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Knowledge-based reduction took 3129 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 240/240 transitions.
Applied a total of 0 rules in 13 ms. Remains 197 /197 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-677466433212687986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2458715981981380384.kers'
[2026-06-16 13:17:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-677466433212687986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2458715981981380384.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 240 rows 189 cols 786 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-06-16 13:17:22] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2458715981981380384.kers
Total runtime 3 ms.
[2026-06-16 13:17:23] [INFO ] Implicit Places using invariants in 580 ms returned []
[2026-06-16 13:17:23] [INFO ] Invariant cache hit.
[2026-06-16 13:17:23] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:17:24] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2026-06-16 13:17:24] [INFO ] Redundant transitions in 4 ms returned []
Running 230 sub problems to find dead transitions.
[2026-06-16 13:17:24] [INFO ] Invariant cache hit.
[2026-06-16 13:17:24] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 240/437 variables, 197/233 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 80/313 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/437 variables, and 313 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 11/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 240/437 variables, 197/233 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 80/313 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 230/543 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 543 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61793 ms. Remains : 197/197 places, 240/240 transitions.
Computed a total of 28 stabilizing places and 79 stable transitions
Computed a total of 28 stabilizing places and 79 stable transitions
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 906280 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 906280 steps, saw 227373 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
[2026-06-16 13:18:27] [INFO ] Invariant cache hit.
[2026-06-16 13:18:27] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/182 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/197 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/437 variables, 197/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 80/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/182 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/197 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 240/437 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/437 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1553 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1827ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 240/240 transitions.
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 197 transition count 161
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 164 place count 112 transition count 161
Applied a total of 164 rules in 25 ms. Remains 112 /197 variables (removed 85) and now considering 161/240 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 112/197 places, 161/240 transitions.
RANDOM walk for 40000 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 356525 steps, run visited all 1 properties in 783 ms. (steps per millisecond=455 )
Probabilistic random walk after 356525 steps, saw 77302 distinct states, run finished after 783 ms. (steps per millisecond=455 ) properties seen :1
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Knowledge-based reduction took 5950 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 476 ms.
Product exploration explored 100000 steps with 0 reset in 398 ms.
Built C files in :
/tmp/ltsmin2474291565901436683
[2026-06-16 13:18:31] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2026-06-16 13:18:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:18:31] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2026-06-16 13:18:31] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:18:31] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2026-06-16 13:18:31] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:18:31] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2474291565901436683
Running compilation step : cd /tmp/ltsmin2474291565901436683;'/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 1031 ms.
Running link step : cd /tmp/ltsmin2474291565901436683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin2474291565901436683;'/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/stateBased9449479279731186398.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 197 /197 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2026-06-16 13:18:46] [INFO ] Invariant cache hit.
[2026-06-16 13:18:47] [INFO ] Implicit Places using invariants in 430 ms returned []
[2026-06-16 13:18:47] [INFO ] Invariant cache hit.
[2026-06-16 13:18:47] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:18:47] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2026-06-16 13:18:47] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1244 ms. Remains : 197/197 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin5973112716178536091
[2026-06-16 13:18:47] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2026-06-16 13:18:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:18:47] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2026-06-16 13:18:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:18:47] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2026-06-16 13:18:47] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:18:48] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5973112716178536091
Running compilation step : cd /tmp/ltsmin5973112716178536091;'/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 753 ms.
Running link step : cd /tmp/ltsmin5973112716178536091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin5973112716178536091;'/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/stateBased2630543672894027839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-16 13:19:03] [INFO ] Flatten gal took : 20 ms
[2026-06-16 13:19:03] [INFO ] Flatten gal took : 16 ms
[2026-06-16 13:19:03] [INFO ] Time to serialize gal into /tmp/LTL14678263226950931183.gal : 3 ms
[2026-06-16 13:19:03] [INFO ] Time to serialize properties into /tmp/LTL17830620882182778205.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/LTL14678263226950931183.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6275122889077875600.hoa' '-atoms' '/tmp/LTL17830620882182778205.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/LTL17830620882182778205.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6275122889077875600.hoa
Detected timeout of ITS tools.
[2026-06-16 13:19:18] [INFO ] Flatten gal took : 15 ms
[2026-06-16 13:19:18] [INFO ] Flatten gal took : 15 ms
[2026-06-16 13:19:18] [INFO ] Time to serialize gal into /tmp/LTL7996704348747163650.gal : 3 ms
[2026-06-16 13:19:18] [INFO ] Time to serialize properties into /tmp/LTL17170997405463598300.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/LTL7996704348747163650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17170997405463598300.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(endloop_6_11<=beginloop_7_12)"))))
Formula 0 simplified : GF!"(endloop_6_11<=beginloop_7_12)"
Detected timeout of ITS tools.
[2026-06-16 13:19:33] [INFO ] Flatten gal took : 11 ms
[2026-06-16 13:19:33] [INFO ] Applying decomposition
[2026-06-16 13:19:33] [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/graph6055162955908393623.txt' '-o' '/tmp/graph6055162955908393623.bin' '-w' '/tmp/graph6055162955908393623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6055162955908393623.bin' '-l' '-1' '-v' '-w' '/tmp/graph6055162955908393623.weights' '-q' '0' '-e' '0.001'
[2026-06-16 13:19:33] [INFO ] Decomposing Gal with order
[2026-06-16 13:19:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 13:19:33] [INFO ] Removed a total of 64 redundant transitions.
[2026-06-16 13:19:33] [INFO ] Flatten gal took : 52 ms
[2026-06-16 13:19:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 8 ms.
[2026-06-16 13:19:33] [INFO ] Time to serialize gal into /tmp/LTL15619447671992313713.gal : 5 ms
[2026-06-16 13:19:33] [INFO ] Time to serialize properties into /tmp/LTL9349468630506208017.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/LTL15619447671992313713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9349468630506208017.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu1.endloop_6_11<=gu1.beginloop_7_12)"))))
Formula 0 simplified : GF!"(gu1.endloop_6_11<=gu1.beginloop_7_12)"
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N03I10B08-LTLCardinality-04 finished in 210717 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(p1))&&p0))))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 363/363 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 308 transition count 363
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 293 transition count 348
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 293 transition count 348
Applied a total of 38 rules in 9 ms. Remains 293 /316 variables (removed 23) and now considering 348/363 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7692707023036960713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13317374150298924426.kers'
[2026-06-16 13:19:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7692707023036960713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13317374150298924426.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 348 rows 285 cols 954 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-16 13:19:48] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13317374150298924426.kers
Total runtime 7 ms.
[2026-06-16 13:19:49] [INFO ] Implicit Places using invariants in 666 ms returned []
[2026-06-16 13:19:49] [INFO ] Invariant cache hit.
[2026-06-16 13:19:49] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:19:50] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-16 13:19:50] [INFO ] Invariant cache hit.
[2026-06-16 13:19:50] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 338 unsolved
SMT process timed out in 30115ms, After SMT, problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 30116ms
Starting structural reductions in LTL mode, iteration 1 : 293/316 places, 348/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31851 ms. Remains : 293/316 places, 348/363 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(p1))&&p0))))'
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLCardinality-05 finished in 32173 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)))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 363/363 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 308 transition count 363
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 293 transition count 348
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 293 transition count 348
Applied a total of 38 rules in 11 ms. Remains 293 /316 variables (removed 23) and now considering 348/363 (removed 15) transitions.
[2026-06-16 13:20:20] [INFO ] Invariant cache hit.
[2026-06-16 13:20:21] [INFO ] Implicit Places using invariants in 831 ms returned []
[2026-06-16 13:20:21] [INFO ] Invariant cache hit.
[2026-06-16 13:20:21] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:20:22] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 293/316 places, 348/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2033 ms. Remains : 293/316 places, 348/363 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)))'
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLCardinality-08
Product exploration explored 100000 steps with 1 reset in 452 ms.
Stack based approach found an accepted trace after 170 steps with 0 reset with depth 171 and stack size 171 in 1 ms.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLCardinality-08 finished in 2602 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&&(F(p0) U p1)&&F(p2)))&&F(G(!p1))))'
Support contains 6 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 363/363 transitions.
Graph (complete) has 763 edges and 316 vertex of which 309 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 309 transition count 353
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 299 transition count 353
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 33 place count 287 transition count 341
Iterating global reduction 2 with 12 rules applied. Total rules applied 45 place count 287 transition count 341
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 219 place count 200 transition count 254
Applied a total of 219 rules in 50 ms. Remains 200 /316 variables (removed 116) and now considering 254/363 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8585807916471882310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18058633746743018828.kers'
[2026-06-16 13:20:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8585807916471882310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18058633746743018828.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 254 rows 192 cols 839 entries
Finished phase 1 with 182 SingleSign rule and 0 generalized
[2026-06-16 13:20:23] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18058633746743018828.kers
Total runtime 4 ms.
[2026-06-16 13:20:23] [INFO ] Implicit Places using invariants in 606 ms returned []
[2026-06-16 13:20:23] [INFO ] Invariant cache hit.
[2026-06-16 13:20:24] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:20:25] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
[2026-06-16 13:20:25] [INFO ] Redundant transitions in 1 ms returned []
Running 244 sub problems to find dead transitions.
[2026-06-16 13:20:25] [INFO ] Invariant cache hit.
[2026-06-16 13:20:25] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 11/199 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 254/453 variables, 199/244 constraints. Problems are: Problem set: 0 solved, 244 unsolved
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 30079ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/316 places, 254/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31899 ms. Remains : 200/316 places, 254/363 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&&(F(p0) U p1)&&F(p2)))&&F(G(!p1))))'
Stuttering acceptance computed with spot in 336 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), p1, (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 230 ms.
Stack based approach found an accepted trace after 129 steps with 1 reset with depth 82 and stack size 82 in 1 ms.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLCardinality-09 finished in 32524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 363/363 transitions.
Graph (complete) has 763 edges and 316 vertex of which 308 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 308 transition count 353
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 298 transition count 353
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 36 place count 283 transition count 338
Iterating global reduction 2 with 15 rules applied. Total rules applied 51 place count 283 transition count 338
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 225 place count 196 transition count 251
Applied a total of 225 rules in 45 ms. Remains 196 /316 variables (removed 120) and now considering 251/363 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17639192373999505302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5040675718054544298.kers'
[2026-06-16 13:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17639192373999505302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5040675718054544298.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 251 rows 188 cols 832 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-16 13:20:55] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5040675718054544298.kers
Total runtime 5 ms.
[2026-06-16 13:20:56] [INFO ] Implicit Places using invariants in 560 ms returned []
[2026-06-16 13:20:56] [INFO ] Invariant cache hit.
[2026-06-16 13:20:56] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:20:57] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
[2026-06-16 13:20:57] [INFO ] Redundant transitions in 2 ms returned []
Running 241 sub problems to find dead transitions.
[2026-06-16 13:20:57] [INFO ] Invariant cache hit.
[2026-06-16 13:20:57] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 251/447 variables, 196/233 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 80/313 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 313 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 11/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 251/447 variables, 196/233 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 80/313 constraints. Problems are: Problem set: 12 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 229/542 constraints. Problems are: Problem set: 12 solved, 229 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 542 constraints, problems are : Problem set: 12 solved, 229 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/241 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 12 solved, 229 unsolved
Search for dead transitions found 12 dead transitions in 60097ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 196/316 places, 239/363 transitions.
Applied a total of 0 rules in 10 ms. Remains 196 /196 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-16 13:21:57] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 62073 ms. Remains : 196/316 places, 239/363 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 312 ms.
Product exploration explored 100000 steps with 0 reset in 364 ms.
Computed a total of 27 stabilizing places and 78 stable transitions
Computed a total of 27 stabilizing places and 78 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36907 steps (8 resets) in 38 ms. (946 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 32 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 172 ms.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property FileSystem-PT-N03I10B08-LTLCardinality-13 finished in 63048 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(G(p0))))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 363/363 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 308 transition count 363
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 293 transition count 348
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 293 transition count 348
Applied a total of 38 rules in 11 ms. Remains 293 /316 variables (removed 23) and now considering 348/363 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1438075275102823254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6387576604762680801.kers'
[2026-06-16 13:21:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1438075275102823254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6387576604762680801.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 348 rows 285 cols 954 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-16 13:21:58] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6387576604762680801.kers
Total runtime 5 ms.
[2026-06-16 13:21:59] [INFO ] Implicit Places using invariants in 602 ms returned []
[2026-06-16 13:21:59] [INFO ] Invariant cache hit.
[2026-06-16 13:21:59] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:22:01] [INFO ] Implicit Places using invariants and state equation in 1906 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-16 13:22:01] [INFO ] Invariant cache hit.
[2026-06-16 13:22:01] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/641 variables, and 55 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 11/293 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 30/55 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/641 variables, and 74 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/338 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 293/316 places, 348/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62617 ms. Remains : 293/316 places, 348/363 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(G(p0))))'
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLCardinality-14 finished in 62832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X(X((p1||F(p2))))))))'
Spot run failed in 87 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 80 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-06-16 13:23:01] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17461757844501363331
[2026-06-16 13:23:01] [INFO ] Computing symmetric may disable matrix : 363 transitions.
[2026-06-16 13:23:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:23:01] [INFO ] Computing symmetric may enable matrix : 363 transitions.
[2026-06-16 13:23:01] [INFO ] Applying decomposition
[2026-06-16 13:23:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:23:01] [INFO ] Flatten gal took : 21 ms
[2026-06-16 13:23:01] [INFO ] Computing Do-Not-Accords matrix : 363 transitions.
[2026-06-16 13:23:02] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10664009415049992061.txt' '-o' '/tmp/graph10664009415049992061.bin' '-w' '/tmp/graph10664009415049992061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10664009415049992061.bin' '-l' '-1' '-v' '-w' '/tmp/graph10664009415049992061.weights' '-q' '0' '-e' '0.001'
[2026-06-16 13:23:02] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17461757844501363331
Running compilation step : cd /tmp/ltsmin17461757844501363331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-06-16 13:23:02] [INFO ] Decomposing Gal with order
[2026-06-16 13:23:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 13:23:02] [INFO ] Removed a total of 316 redundant transitions.
[2026-06-16 13:23:02] [INFO ] Flatten gal took : 54 ms
[2026-06-16 13:23:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 27 ms.
[2026-06-16 13:23:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality14407581824797711484.gal : 7 ms
[2026-06-16 13:23:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality16131978030506025898.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/LTLCardinality14407581824797711484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16131978030506025898.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...299
Read 2 LTL properties
Checking formula 0 : !((X(G((G("(gu89.busy_11_20>gu89.loop_6_18)"))U(X(X(("(gu82.endloop_8_11<=gu82.loop_5_13)")||(F("(gi1.gi1.gu95.loop_8_16>=1)")))))))))
Formula 0 simplified : XF(F!"(gu89.busy_11_20>gu89.loop_6_18)" R XX(!"(gu82.endloop_8_11<=gu82.loop_5_13)" & G!"(gi1.gi1.gu95.loop_8_16>=1)"))
Compilation finished in 1590 ms.
Running link step : cd /tmp/ltsmin17461757844501363331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17461757844501363331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([](([]((LTLAPp0==true)) U X(X(((LTLAPp1==true)||<>((LTLAPp2==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.t220, gi1.gi0.t222, gi1.gi0.t223, gi1.gi0.t226, gi1.gi0.t227, gi1.gi0.t229, gi1.gi1.t...1125
LTSmin run took 401019 ms.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17461757844501363331;'/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' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
236 unique states visited
68 strongly connected components in search stack
242 transitions explored
95 items max in DFS search stack
59811 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,598.232,7749336,1,0,651,2.35409e+07,38,327,5127,2.29084e+07,1505
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !((F(G("(gu34.endloop_6_11<=gu34.beginloop_7_12)"))))
Formula 1 simplified : GF!"(gu34.endloop_6_11<=gu34.beginloop_7_12)"
LTSmin run took 405425 ms.
FORMULA FileSystem-PT-N03I10B08-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1457864 ms.
BK_STOP 1781616990756
--------------------
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="FileSystem-PT-N03I10B08"
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 FileSystem-PT-N03I10B08, 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 r338-smll-178021499300435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N03I10B08.tgz
mv FileSystem-PT-N03I10B08 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 ;