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 |
| 2769.403 | 1787349.00 | 1923943.00 | 5332.50 | TTTFTFTTTFFTFFFF | 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-178021499300434.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300434
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-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 33K May 27 10:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 27 10:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:48 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 5.8K May 27 10:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K May 27 10:48 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-CTLFireability-2024-00
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-01
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-02
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-03
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-04
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-05
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-06
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-07
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-08
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-09
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-10
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-11
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-12
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-13
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-14
FORMULA_NAME FileSystem-PT-N03I10B08-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1781105304304
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
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
CTLFireability PT
Running Version 202604301425
[2026-06-10 15:28:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 15:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 15:28:27] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2026-06-10 15:28:27] [INFO ] Transformed 455 places.
[2026-06-10 15:28:27] [INFO ] Transformed 420 transitions.
[2026-06-10 15:28:27] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 107 out of 445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 420/420 transitions.
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 365 transition count 420
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 134 place count 311 transition count 366
Iterating global reduction 1 with 54 rules applied. Total rules applied 188 place count 311 transition count 366
Applied a total of 188 rules in 135 ms. Remains 311 /445 variables (removed 134) and now considering 366/420 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16854016513938037257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11630716711632491834.kers'
[2026-06-10 15:28:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16854016513938037257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11630716711632491834.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 366 rows 303 cols 1008 entries
Finished phase 1 with 293 SingleSign rule and 0 generalized
[2026-06-10 15:28:27] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11630716711632491834.kers
Total runtime 7 ms.
[2026-06-10 15:28:28] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2026-06-10 15:28:28] [INFO ] Invariant cache hit.
[2026-06-10 15:28:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:28:30] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 3048 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2026-06-10 15:28:30] [INFO ] Invariant cache hit.
[2026-06-10 15:28:30] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 11/311 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/677 variables, and 45 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/311 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 11/311 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 366/677 variables, 311/360 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 80/440 constraints. Problems are: Problem set: 12 solved, 344 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 344/784 constraints. Problems are: Problem set: 12 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/677 variables, and 784 constraints, problems are : Problem set: 12 solved, 344 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 311/311 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 344/356 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60381ms problems are : Problem set: 12 solved, 344 unsolved
Search for dead transitions found 12 dead transitions in 60418ms
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 LTL mode, iteration 1 : 311/445 places, 354/420 transitions.
Reduce places removed 0 places and 3 transitions.
Deduced a syphon composed of 3 places in 4 ms
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 351/354 (removed 3) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63705 ms. Remains : 311/445 places, 351/420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 351/351 transitions.
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 351/351 (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-11823075173688746900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9650249359505261899.kers'
[2026-06-10 15:29:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11823075173688746900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9650249359505261899.kers]
Culling trivial invariants: removing 3 columns.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 351 rows 300 cols 963 entries
Finished phase 1 with 290 SingleSign rule and 0 generalized
[2026-06-10 15:29:31] [INFO ] Computed 21 invariants in 3 ms
Computed 21 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9650249359505261899.kers
Total runtime 5 ms.
[2026-06-10 15:29:31] [INFO ] Implicit Places using invariants in 573 ms returned []
[2026-06-10 15:29:31] [INFO ] Invariant cache hit.
[2026-06-10 15:29:32] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:29:32] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2026-06-10 15:29:32] [INFO ] Invariant cache hit.
[2026-06-10 15:29:32] [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, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 11/308 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/662 variables, and 49 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, State Equation: 0/311 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (OVERLAPS) 11/308 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/662 variables, and 68 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, State Equation: 0/311 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/341 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in LTL mode , in 1 iterations and 61827 ms. Remains : 311/311 places, 351/351 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Support contains 104 out of 308 places after structural reductions.
[2026-06-10 15:30:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-06-10 15:30:33] [INFO ] Flatten gal took : 83 ms
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 15:30:33] [INFO ] Flatten gal took : 39 ms
[2026-06-10 15:30:33] [INFO ] Input system was already deterministic with 351 transitions.
Support contains 100 out of 308 places (down from 104) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 69 to 68
RANDOM walk for 40000 steps (8 resets) in 3701 ms. (10 steps per ms) remains 34/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 26/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12278774654088391217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1397951409018957648.kers'
[2026-06-10 15:30:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12278774654088391217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1397951409018957648.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 351 rows 300 cols 963 entries
Finished phase 1 with 290 SingleSign rule and 0 generalized
[2026-06-10 15:30:34] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1397951409018957648.kers
Total runtime 7 ms.
[2026-06-10 15:30:34] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 2 (OVERLAPS) 268/306 variables, 14/16 constraints. Problems are: Problem set: 1 solved, 21 unsolved
SMT process timed out in 5109ms, After SMT, problems are : Problem set: 1 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 351/351 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 308 transition count 341
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 298 transition count 341
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 291 transition count 334
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 291 transition count 334
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 176 place count 220 transition count 263
Free-agglomeration rule (complex) applied 62 times.
Iterating global reduction 2 with 62 rules applied. Total rules applied 238 place count 220 transition count 201
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 300 place count 158 transition count 201
Applied a total of 300 rules in 77 ms. Remains 158 /308 variables (removed 150) and now considering 201/351 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 158/308 places, 201/351 transitions.
RANDOM walk for 40000 steps (8 resets) in 732 ms. (54 steps per ms) remains 17/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 12/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 10/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-395739545737659841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1614055886839586080.kers'
[2026-06-10 15:30:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-395739545737659841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1614055886839586080.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 201 rows 148 cols 546 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-06-10 15:30:40] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1614055886839586080.kers
Total runtime 3 ms.
[2026-06-10 15:30:40] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 16/35 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 117/152 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 6/158 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 201/359 variables, 158/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 80/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/359 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 276 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3521 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 158/158 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 16/35 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 117/152 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 6/158 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 201/359 variables, 158/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 80/288 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/359 variables, 9/297 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/359 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/359 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 297 constraints, problems are : Problem set: 1 solved, 9 unsolved in 4224 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 158/158 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7758ms problems are : Problem set: 1 solved, 9 unsolved
Parikh walk visited 5 properties in 677 ms.
Support contains 12 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 201/201 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 156 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 156 transition count 199
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 34 place count 141 transition count 184
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 50 place count 141 transition count 168
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 68 place count 123 transition count 168
Applied a total of 68 rules in 34 ms. Remains 123 /158 variables (removed 35) and now considering 168/201 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 123/158 places, 168/201 transitions.
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 84 ms. (470 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-15904477233485333805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5454436217997357613.kers'
[2026-06-10 15:30:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15904477233485333805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5454436217997357613.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 168 rows 112 cols 430 entries
Finished phase 1 with 105 SingleSign rule and 2 generalized
[2026-06-10 15:30:48] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5454436217997357613.kers
Total runtime 2 ms.
[2026-06-10 15:30:48] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 98/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/123 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 168/291 variables, 123/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 80/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 224 constraints, problems are : Problem set: 0 solved, 3 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 98/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/123 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/291 variables, 123/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 80/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/291 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 229 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1916ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 10 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 120 transition count 166
Applied a total of 5 rules in 18 ms. Remains 120 /123 variables (removed 3) and now considering 166/168 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 120/123 places, 166/168 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 820546 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :1 out of 3
Probabilistic random walk after 820546 steps, saw 172972 distinct states, run finished after 3007 ms. (steps per millisecond=272 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13482946132309957918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6836429629986570582.kers'
[2026-06-10 15:30:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13482946132309957918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6836429629986570582.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 166 rows 110 cols 424 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-06-10 15:30:54] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6836429629986570582.kers
Total runtime 2 ms.
[2026-06-10 15:30:54] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 101/111 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/120 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 166/286 variables, 120/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 80/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/286 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 101/111 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/120 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 166/286 variables, 120/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 80/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/286 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 234 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1148 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2053ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 166/166 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 115 transition count 163
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 115 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 114 transition count 162
Applied a total of 10 rules in 18 ms. Remains 114 /120 variables (removed 6) and now considering 162/166 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 114/120 places, 162/166 transitions.
RANDOM walk for 40000 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Probably explored full state space saw : 161939 states, properties seen :0
Probabilistic random walk after 775547 steps, saw 161939 distinct states, run finished after 2342 ms. (steps per millisecond=331 ) properties seen :0
Explored full state space saw : 161939 states, properties seen :0
Exhaustive walk after 775547 steps, saw 161939 distinct states, run finished after 2406 ms. (steps per millisecond=322 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2026-06-10 15:31:01] [INFO ] Flatten gal took : 27 ms
[2026-06-10 15:31:01] [INFO ] Flatten gal took : 29 ms
[2026-06-10 15:31:01] [INFO ] Input system was already deterministic with 351 transitions.
Computed a total of 60 stabilizing places and 111 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 351/351 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 295 transition count 338
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 295 transition count 338
Applied a total of 26 rules in 8 ms. Remains 295 /308 variables (removed 13) and now considering 338/351 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1976984774908116749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14633594399949575282.kers'
[2026-06-10 15:31:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1976984774908116749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14633594399949575282.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 338 rows 287 cols 924 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-06-10 15:31:01] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14633594399949575282.kers
Total runtime 4 ms.
[2026-06-10 15:31:01] [INFO ] Implicit Places using invariants in 414 ms returned []
[2026-06-10 15:31:01] [INFO ] Invariant cache hit.
[2026-06-10 15:31:01] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:31:02] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2026-06-10 15:31:02] [INFO ] Invariant cache hit.
[2026-06-10 15:31:02] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 11/295 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/633 variables, and 58 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/295 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 11/295 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 34/58 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 338/633 variables, 295/363 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 80/443 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/633 variables, and 771 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 295/295 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 338/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61684 ms. Remains : 295/308 places, 338/351 transitions.
[2026-06-10 15:32:02] [INFO ] Flatten gal took : 37 ms
[2026-06-10 15:32:03] [INFO ] Flatten gal took : 49 ms
[2026-06-10 15:32:03] [INFO ] Input system was already deterministic with 338 transitions.
[2026-06-10 15:32:03] [INFO ] Flatten gal took : 30 ms
[2026-06-10 15:32:03] [INFO ] Flatten gal took : 30 ms
[2026-06-10 15:32:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14380435275454915327.gal : 38 ms
[2026-06-10 15:32:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11367777598555842099.ctl : 17 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14380435275454915327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11367777598555842099.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.55732e+06,6.03111,125664,2,51251,5,359221,6,0,1487,520103,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:32:33] [INFO ] Flatten gal took : 18 ms
[2026-06-10 15:32:33] [INFO ] Applying decomposition
[2026-06-10 15:32:33] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6225136029498936868.txt' '-o' '/tmp/graph6225136029498936868.bin' '-w' '/tmp/graph6225136029498936868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6225136029498936868.bin' '-l' '-1' '-v' '-w' '/tmp/graph6225136029498936868.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:32:33] [INFO ] Decomposing Gal with order
[2026-06-10 15:32:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:32:33] [INFO ] Removed a total of 323 redundant transitions.
[2026-06-10 15:32:33] [INFO ] Flatten gal took : 126 ms
[2026-06-10 15:32:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 17 ms.
[2026-06-10 15:32:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11279766339729147173.gal : 16 ms
[2026-06-10 15:32:33] [INFO ] Time to serialize properties into /tmp/CTLFireability10750192651691252927.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11279766339729147173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10750192651691252927.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.55732e+06,9.47748,214372,9811,27,306882,323,815,1.30501e+06,27,732,0
Converting to forward existential form...Done !
original formula: ((EG(((AG(((EX(((i1.u31.beginloop_7_12>=1)&&(i1.u72.lockb_12>=1))) * (i0.u48.busy_11_20>=1)) * (i0.u10.testbusy_3_11>=1))) * (i5.u50.busy...885
=> equivalent forward existential formula: (([FwdG(Init,((!(E(TRUE U !(((EX(((i1.u31.beginloop_7_12>=1)&&(i1.u72.lockb_12>=1))) * (i0.u48.busy_11_20>=1)) *...1037
Reverse transition relation is NOT exact ! Due to transitions t180, t184, t191, t213, t216, t222, t227, t229, t234, t241, t263, t265, t275, t285, t295, t29...849
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 351/351 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 308 transition count 341
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 298 transition count 341
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 35 place count 283 transition count 326
Iterating global reduction 2 with 15 rules applied. Total rules applied 50 place count 283 transition count 326
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 224 place count 196 transition count 239
Applied a total of 224 rules in 37 ms. Remains 196 /308 variables (removed 112) and now considering 239/351 (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-183281441156214112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1933275710281243650.kers'
[2026-06-10 15:33:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-183281441156214112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1933275710281243650.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 239 rows 188 cols 784 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-10 15:33:03] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1933275710281243650.kers
Total runtime 2 ms.
[2026-06-10 15:33:04] [INFO ] Implicit Places using invariants in 585 ms returned []
[2026-06-10 15:33:04] [INFO ] Invariant cache hit.
[2026-06-10 15:33:04] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:33:05] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2026-06-10 15:33:05] [INFO ] Redundant transitions in 21 ms returned []
Running 229 sub problems to find dead transitions.
[2026-06-10 15:33:05] [INFO ] Invariant cache hit.
[2026-06-10 15:33:05] [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, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 239/435 variables, 196/234 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 80/314 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 314 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 11/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 239/435 variables, 196/234 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 80/314 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 229/543 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 543 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/308 places, 239/351 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62104 ms. Remains : 196/308 places, 239/351 transitions.
[2026-06-10 15:34:06] [INFO ] Flatten gal took : 19 ms
[2026-06-10 15:34:06] [INFO ] Flatten gal took : 19 ms
[2026-06-10 15:34:06] [INFO ] Input system was already deterministic with 239 transitions.
[2026-06-10 15:34:06] [INFO ] Flatten gal took : 28 ms
[2026-06-10 15:34:06] [INFO ] Flatten gal took : 31 ms
RANDOM walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
[2026-06-10 15:34:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4773673445270487910.gal : 4 ms
[2026-06-10 15:34:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3004463485760729241.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4773673445270487910.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3004463485760729241.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 17534 steps (5 resets) in 51 ms. (337 steps per ms) remains 0/1 properties
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 351/351 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 308 transition count 341
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 298 transition count 341
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 35 place count 283 transition count 326
Iterating global reduction 2 with 15 rules applied. Total rules applied 50 place count 283 transition count 326
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 224 place count 196 transition count 239
Applied a total of 224 rules in 54 ms. Remains 196 /308 variables (removed 112) and now considering 239/351 (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-4238313262933790145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3483680463736237319.kers'
[2026-06-10 15:34:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4238313262933790145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3483680463736237319.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 239 rows 188 cols 784 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-10 15:34:06] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3483680463736237319.kers
Total runtime 4 ms.
[2026-06-10 15:34:06] [INFO ] Implicit Places using invariants in 370 ms returned []
[2026-06-10 15:34:06] [INFO ] Invariant cache hit.
[2026-06-10 15:34:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:34:07] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2026-06-10 15:34:07] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 196/308 places, 239/351 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1231 ms. Remains : 196/308 places, 239/351 transitions.
[2026-06-10 15:34:07] [INFO ] Flatten gal took : 15 ms
[2026-06-10 15:34:07] [INFO ] Flatten gal took : 16 ms
[2026-06-10 15:34:07] [INFO ] Input system was already deterministic with 239 transitions.
[2026-06-10 15:34:07] [INFO ] Flatten gal took : 16 ms
[2026-06-10 15:34:07] [INFO ] Flatten gal took : 16 ms
[2026-06-10 15:34:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10158715323936871794.gal : 4 ms
[2026-06-10 15:34:07] [INFO ] Time to serialize properties into /tmp/CTLFireability4139263124841382619.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10158715323936871794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4139263124841382619.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,853303,3.38577,73128,2,16071,5,185829,6,0,992,284970,0
Converting to forward existential form...Done !
original formula: EF(((loop_1_16>=1) * AF(((busy_18_19<1)||(testbusy_7_18<1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (loop_1_16>=1)) * !(EG(!(((busy_18_19<1)||(testbusy_7_18<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108,...622
(forward)formula 0,1,27.3845,536080,1,0,695,2.31287e+06,502,289,7184,2.28371e+06,694
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 351/351 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 308 transition count 342
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 299 transition count 342
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 32 place count 285 transition count 328
Iterating global reduction 2 with 14 rules applied. Total rules applied 46 place count 285 transition count 328
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 218 place count 199 transition count 242
Applied a total of 218 rules in 51 ms. Remains 199 /308 variables (removed 109) and now considering 242/351 (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-15196569776310317193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3966950959561951319.kers'
[2026-06-10 15:34:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15196569776310317193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3966950959561951319.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 242 rows 191 cols 790 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-06-10 15:34:35] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3966950959561951319.kers
Total runtime 3 ms.
[2026-06-10 15:34:35] [INFO ] Implicit Places using invariants in 620 ms returned []
[2026-06-10 15:34:35] [INFO ] Invariant cache hit.
[2026-06-10 15:34:36] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:34:37] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2026-06-10 15:34:37] [INFO ] Redundant transitions in 6 ms returned []
Running 232 sub problems to find dead transitions.
[2026-06-10 15:34:37] [INFO ] Invariant cache hit.
[2026-06-10 15:34:37] [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, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 11/199 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 242/441 variables, 199/235 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 80/315 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/441 variables, and 315 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 199/199 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 11/199 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 242/441 variables, 199/235 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 80/315 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 232/547 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 547 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 199/199 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in SI_CTL mode, iteration 1 : 199/308 places, 242/351 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62035 ms. Remains : 199/308 places, 242/351 transitions.
[2026-06-10 15:35:37] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:35:37] [INFO ] Flatten gal took : 14 ms
[2026-06-10 15:35:37] [INFO ] Input system was already deterministic with 242 transitions.
[2026-06-10 15:35:37] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:35:37] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:35:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11700386673590005581.gal : 2 ms
[2026-06-10 15:35:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16217068922416970314.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11700386673590005581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16217068922416970314.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,944347,3.56869,79552,2,19209,5,207972,6,0,1007,308229,0
Converting to forward existential form...Done !
original formula: E(E(EF(((loop_2_14>=1) + EG((endloop_10_17>=1)))) U (initblock_4>=1)) U (loop_4_13>=1))
=> equivalent forward existential formula: [(FwdU(Init,E(E(TRUE U ((loop_2_14>=1) + EG((endloop_10_17>=1)))) U (initblock_4>=1))) * (loop_4_13>=1))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108, t109, t110, t111, t...626
Detected timeout of ITS tools.
[2026-06-10 15:36:07] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:36:07] [INFO ] Applying decomposition
[2026-06-10 15:36:07] [INFO ] Flatten gal took : 8 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/graph3065158809276921304.txt' '-o' '/tmp/graph3065158809276921304.bin' '-w' '/tmp/graph3065158809276921304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3065158809276921304.bin' '-l' '-1' '-v' '-w' '/tmp/graph3065158809276921304.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:36:07] [INFO ] Decomposing Gal with order
[2026-06-10 15:36:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:36:07] [INFO ] Removed a total of 65 redundant transitions.
[2026-06-10 15:36:07] [INFO ] Flatten gal took : 22 ms
[2026-06-10 15:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 8 ms.
[2026-06-10 15:36:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13540621133460581233.gal : 5 ms
[2026-06-10 15:36:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14222601658168409368.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13540621133460581233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14222601658168409368.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,944347,3.49943,78152,1494,5331,53082,97533,623,204716,354,603657,0
Converting to forward existential form...Done !
original formula: E(E(EF(((i6.u13.loop_2_14>=1) + EG((i1.u15.endloop_10_17>=1)))) U (i1.u1.initblock_4>=1)) U (i4.u12.loop_4_13>=1))
=> equivalent forward existential formula: [(FwdU(Init,E(E(TRUE U ((i6.u13.loop_2_14>=1) + EG((i1.u15.endloop_10_17>=1)))) U (i1.u1.initblock_4>=1))) * (i4...184
Reverse transition relation is NOT exact ! Due to transitions t105, t109, t118, t123, t129, t144, t152, t165, t181, t190, t199, t209, t231, t241, i1.u15.t9...402
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,28.7053,585236,1,0,714462,490529,2918,1.80812e+06,2555,3.50999e+06,1223640
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 351/351 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 294 transition count 337
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 294 transition count 337
Applied a total of 28 rules in 12 ms. Remains 294 /308 variables (removed 14) and now considering 337/351 (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-15481358623447672745.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-167828048990367823.kers'
[2026-06-10 15:36:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15481358623447672745.kers, --Pflows, --basisKERS=/tmp/petrispot-output-167828048990367823.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 337 rows 286 cols 921 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-10 15:36:36] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-167828048990367823.kers
Total runtime 5 ms.
[2026-06-10 15:36:37] [INFO ] Implicit Places using invariants in 679 ms returned []
[2026-06-10 15:36:37] [INFO ] Invariant cache hit.
[2026-06-10 15:36:37] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:36:38] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1832 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-06-10 15:36:38] [INFO ] Invariant cache hit.
[2026-06-10 15:36:38] [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, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 11/294 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 294/631 variables, and 61 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/294 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 11/294 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 35/61 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (OVERLAPS) 337/631 variables, 294/365 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 80/445 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 327/772 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/631 variables, and 772 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 294/294 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 294/308 places, 337/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61920 ms. Remains : 294/308 places, 337/351 transitions.
[2026-06-10 15:37:38] [INFO ] Flatten gal took : 12 ms
[2026-06-10 15:37:38] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:37:38] [INFO ] Input system was already deterministic with 337 transitions.
[2026-06-10 15:37:38] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:37:38] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:37:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6196460324517742593.gal : 4 ms
[2026-06-10 15:37:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9578166181962174321.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6196460324517742593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9578166181962174321.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.63571e+06,6.30511,125336,2,49040,5,358004,6,0,1482,525246,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:38:08] [INFO ] Flatten gal took : 16 ms
[2026-06-10 15:38:08] [INFO ] Applying decomposition
[2026-06-10 15:38:08] [INFO ] Flatten gal took : 13 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/graph1453524566753873780.txt' '-o' '/tmp/graph1453524566753873780.bin' '-w' '/tmp/graph1453524566753873780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1453524566753873780.bin' '-l' '-1' '-v' '-w' '/tmp/graph1453524566753873780.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:38:08] [INFO ] Decomposing Gal with order
[2026-06-10 15:38:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:38:08] [INFO ] Removed a total of 323 redundant transitions.
[2026-06-10 15:38:08] [INFO ] Flatten gal took : 28 ms
[2026-06-10 15:38:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 13 ms.
[2026-06-10 15:38:08] [INFO ] Time to serialize gal into /tmp/CTLFireability907063247363169699.gal : 6 ms
[2026-06-10 15:38:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2244078523009846611.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability907063247363169699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2244078523009846611.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 351/351 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 308 transition count 341
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 298 transition count 341
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 35 place count 283 transition count 326
Iterating global reduction 2 with 15 rules applied. Total rules applied 50 place count 283 transition count 326
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 220 place count 198 transition count 241
Applied a total of 220 rules in 45 ms. Remains 198 /308 variables (removed 110) and now considering 241/351 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6029962677769688979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5099333216752869066.kers'
[2026-06-10 15:38:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6029962677769688979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5099333216752869066.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 241 rows 190 cols 788 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-10 15:38:38] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5099333216752869066.kers
Total runtime 5 ms.
[2026-06-10 15:38:39] [INFO ] Implicit Places using invariants in 502 ms returned []
[2026-06-10 15:38:39] [INFO ] Invariant cache hit.
[2026-06-10 15:38:39] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:38:40] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2026-06-10 15:38:40] [INFO ] Redundant transitions in 3 ms returned []
Running 231 sub problems to find dead transitions.
[2026-06-10 15:38:40] [INFO ] Invariant cache hit.
[2026-06-10 15:38:40] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 11/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 241/439 variables, 198/250 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 80/330 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/439 variables, and 330 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 198/198 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 11/198 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 33/52 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (OVERLAPS) 241/439 variables, 198/258 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 80/338 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 231/569 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 569 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 198/198 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/308 places, 241/351 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61441 ms. Remains : 198/308 places, 241/351 transitions.
[2026-06-10 15:39:40] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:39:40] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:39:40] [INFO ] Input system was already deterministic with 241 transitions.
[2026-06-10 15:39:40] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:39:40] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:39:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4244984435954283822.gal : 2 ms
[2026-06-10 15:39:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8053284733644684784.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4244984435954283822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8053284733644684784.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,887663,3.18215,73908,2,16670,5,184263,6,0,1002,293580,0
Converting to forward existential form...Done !
original formula: EF(AG(AF(((loop_8_17>=1)&&(((loop_9_17>=1)||(loop_7_14>=1))||((busy_11_19>=1)&&(testbusy_3_11>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((loop_8_17>=1)&&(((loop_9_17>=1)||(loop_7_14>=1))||((busy_11_19>=1)&&(t...191
Reverse transition relation is NOT exact ! Due to transitions t93, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108, t109, t110, t1...625
(forward)formula 0,0,29.0372,624340,1,0,597,2.76349e+06,510,246,7455,2.81243e+06,560
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 351/351 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 293 transition count 336
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 293 transition count 336
Applied a total of 30 rules in 7 ms. Remains 293 /308 variables (removed 15) and now considering 336/351 (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-6480794544029969841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13884781544006549494.kers'
[2026-06-10 15:40:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6480794544029969841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13884781544006549494.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 336 rows 285 cols 918 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-10 15:40:09] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13884781544006549494.kers
Total runtime 7 ms.
[2026-06-10 15:40:10] [INFO ] Implicit Places using invariants in 669 ms returned []
[2026-06-10 15:40:10] [INFO ] Invariant cache hit.
[2026-06-10 15:40:10] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:40:12] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2611 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-06-10 15:40:12] [INFO ] Invariant cache hit.
[2026-06-10 15:40:12] [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, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/629 variables, and 64 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 11/293 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 9 (OVERLAPS) 336/629 variables, 293/368 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 326/774 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/629 variables, and 774 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 293/308 places, 336/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62712 ms. Remains : 293/308 places, 336/351 transitions.
[2026-06-10 15:41:12] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:41:12] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:41:12] [INFO ] Input system was already deterministic with 336 transitions.
[2026-06-10 15:41:12] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:41:12] [INFO ] Flatten gal took : 13 ms
[2026-06-10 15:41:12] [INFO ] Time to serialize gal into /tmp/CTLFireability213289124649348454.gal : 3 ms
[2026-06-10 15:41:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10084457312587465056.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability213289124649348454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10084457312587465056.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5572e+06,6.29408,119876,2,46980,5,348108,6,0,1477,519503,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:41:42] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:41:42] [INFO ] Applying decomposition
[2026-06-10 15:41:42] [INFO ] Flatten gal took : 7 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/graph9201092507368363504.txt' '-o' '/tmp/graph9201092507368363504.bin' '-w' '/tmp/graph9201092507368363504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9201092507368363504.bin' '-l' '-1' '-v' '-w' '/tmp/graph9201092507368363504.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:41:42] [INFO ] Decomposing Gal with order
[2026-06-10 15:41:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:41:42] [INFO ] Removed a total of 321 redundant transitions.
[2026-06-10 15:41:42] [INFO ] Flatten gal took : 26 ms
[2026-06-10 15:41:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 13 ms.
[2026-06-10 15:41:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6177807146805680882.gal : 6 ms
[2026-06-10 15:41:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16109452245864771589.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6177807146805680882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16109452245864771589.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5572e+06,13.0253,299752,8384,27,353854,348,851,2.26801e+06,30,927,0
Converting to forward existential form...Done !
original formula: EF(EX((EG(((i3.i1.u51.beginloop_9_18<1)||(i3.i1.u70.lockb_18<1))) * A(((i6.u102.loop_4_13<1)&&(i1.u1.loop_10_11<1)) U (AG(((i3.i1.u59.bus...260
=> equivalent forward existential formula: [(((EY(FwdU(Init,TRUE)) * EG(((i3.i1.u51.beginloop_9_18<1)||(i3.i1.u70.lockb_18<1)))) * !(EG(!((!(E(TRUE U !(((i...620
Reverse transition relation is NOT exact ! Due to transitions t180, t188, t212, t224, t227, t229, t231, t234, t249, t263, t265, t275, t285, t295, t297, t30...906
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 351/351 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 308 transition count 341
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 298 transition count 341
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 35 place count 283 transition count 326
Iterating global reduction 2 with 15 rules applied. Total rules applied 50 place count 283 transition count 326
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 200 place count 208 transition count 251
Applied a total of 200 rules in 31 ms. Remains 208 /308 variables (removed 100) and now considering 251/351 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13223276575613815122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3543502595323989523.kers'
[2026-06-10 15:42:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13223276575613815122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3543502595323989523.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 251 rows 200 cols 801 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-06-10 15:42:12] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3543502595323989523.kers
Total runtime 6 ms.
[2026-06-10 15:42:13] [INFO ] Implicit Places using invariants in 567 ms returned []
[2026-06-10 15:42:13] [INFO ] Invariant cache hit.
[2026-06-10 15:42:13] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:42:14] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
[2026-06-10 15:42:14] [INFO ] Redundant transitions in 1 ms returned []
Running 241 sub problems to find dead transitions.
[2026-06-10 15:42:14] [INFO ] Invariant cache hit.
[2026-06-10 15:42:14] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/208 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 251/459 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 80/321 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 321 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 15/15 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/197 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 11/208 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 251/459 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 80/321 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 241/562 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 562 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in SI_CTL mode, iteration 1 : 208/308 places, 251/351 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61722 ms. Remains : 208/308 places, 251/351 transitions.
[2026-06-10 15:43:14] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:43:14] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:43:14] [INFO ] Input system was already deterministic with 251 transitions.
[2026-06-10 15:43:14] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:43:14] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:43:14] [INFO ] Time to serialize gal into /tmp/CTLFireability18311128447744130449.gal : 3 ms
[2026-06-10 15:43:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1970813360788840370.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18311128447744130449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1970813360788840370.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01954e+06,4.14775,91528,2,19570,5,216136,6,0,1052,395226,0
Converting to forward existential form...Done !
original formula: EG(E((EF((loop_1_14>=1)) + ((busy_15_20>=1)&&(testbusy_2_15>=1))) U ((beginloop_8_15>=1)&&(lockb_15>=1))))
=> equivalent forward existential formula: [FwdG(Init,E((E(TRUE U (loop_1_14>=1)) + ((busy_15_20>=1)&&(testbusy_2_15>=1))) U ((beginloop_8_15>=1)&&(lockb_1...173
Reverse transition relation is NOT exact ! Due to transitions t102, t103, t104, t105, t106, t107, t108, t109, t122, t123, t124, t125, t126, t127, t128, t12...636
Detected timeout of ITS tools.
[2026-06-10 15:43:44] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:43:44] [INFO ] Applying decomposition
[2026-06-10 15:43:44] [INFO ] Flatten gal took : 5 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/graph5343187747707223704.txt' '-o' '/tmp/graph5343187747707223704.bin' '-w' '/tmp/graph5343187747707223704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5343187747707223704.bin' '-l' '-1' '-v' '-w' '/tmp/graph5343187747707223704.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:43:44] [INFO ] Decomposing Gal with order
[2026-06-10 15:43:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:43:44] [INFO ] Removed a total of 97 redundant transitions.
[2026-06-10 15:43:44] [INFO ] Flatten gal took : 17 ms
[2026-06-10 15:43:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 4 ms.
[2026-06-10 15:43:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4865257226883037532.gal : 3 ms
[2026-06-10 15:43:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2336802509662297360.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4865257226883037532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2336802509662297360.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01954e+06,5.39016,113368,3569,4497,144844,78124,606,306275,316,532293,0
Converting to forward existential form...Done !
original formula: EG(E((EF((u10.loop_1_14>=1)) + ((i0.u11.busy_15_20>=1)&&(i0.u25.testbusy_2_15>=1))) U ((i0.u29.beginloop_8_15>=1)&&(i0.u4.lockb_15>=1))))
=> equivalent forward existential formula: [FwdG(Init,E((E(TRUE U (u10.loop_1_14>=1)) + ((i0.u11.busy_15_20>=1)&&(i0.u25.testbusy_2_15>=1))) U ((i0.u29.beg...204
Reverse transition relation is NOT exact ! Due to transitions t122, t129, t148, t151, t159, t164, t177, t206, t223, t234, u8.t133, u8.t134, u8.t135, u8.t13...447
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 351/351 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 308 transition count 341
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 298 transition count 341
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 33 place count 285 transition count 328
Iterating global reduction 2 with 13 rules applied. Total rules applied 46 place count 285 transition count 328
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 196 place count 210 transition count 253
Applied a total of 196 rules in 46 ms. Remains 210 /308 variables (removed 98) and now considering 253/351 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16998938901843634200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16672374188530822040.kers'
[2026-06-10 15:44:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16998938901843634200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16672374188530822040.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 253 rows 202 cols 807 entries
Finished phase 1 with 192 SingleSign rule and 0 generalized
[2026-06-10 15:44:14] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16672374188530822040.kers
Total runtime 3 ms.
[2026-06-10 15:44:15] [INFO ] Implicit Places using invariants in 406 ms returned []
[2026-06-10 15:44:15] [INFO ] Invariant cache hit.
[2026-06-10 15:44:15] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:44:16] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
[2026-06-10 15:44:16] [INFO ] Redundant transitions in 1 ms returned []
Running 243 sub problems to find dead transitions.
[2026-06-10 15:44:16] [INFO ] Invariant cache hit.
[2026-06-10 15:44:16] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 11/210 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 243 unsolved
SMT process timed out in 30079ms, After SMT, problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 30080ms
Starting structural reductions in SI_CTL mode, iteration 1 : 210/308 places, 253/351 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31374 ms. Remains : 210/308 places, 253/351 transitions.
[2026-06-10 15:44:46] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:44:46] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:44:46] [INFO ] Input system was already deterministic with 253 transitions.
[2026-06-10 15:44:46] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:44:46] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:44:46] [INFO ] Time to serialize gal into /tmp/CTLFireability18254461219322899652.gal : 1 ms
[2026-06-10 15:44:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15774320361498846199.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18254461219322899652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15774320361498846199.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,964376,4.76711,97100,2,20102,5,235368,6,0,1062,403800,0
Converting to forward existential form...Done !
original formula: E(!(EG(((EF((loop_2_17>=1)) * A(A((endloop_10_13>=1) U ((busy_13_19>=1)&&(testbusy_9_13>=1))) U (((busy_13_19>=1)&&(testbusy_4_13>=1))||(...257
=> equivalent forward existential formula: [(FwdU(Init,!(EG(((E(TRUE U (loop_2_17>=1)) * !((E(!((((busy_13_19>=1)&&(testbusy_4_13>=1))||((beginloop_1_14>=1...595
Reverse transition relation is NOT exact ! Due to transitions t103, t104, t105, t106, t107, t108, t115, t119, t122, t123, t124, t125, t126, t127, t128, t12...636
Detected timeout of ITS tools.
[2026-06-10 15:45:16] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:45:16] [INFO ] Applying decomposition
[2026-06-10 15:45:16] [INFO ] Flatten gal took : 6 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/graph10463251552504041857.txt' '-o' '/tmp/graph10463251552504041857.bin' '-w' '/tmp/graph10463251552504041857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10463251552504041857.bin' '-l' '-1' '-v' '-w' '/tmp/graph10463251552504041857.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:45:16] [INFO ] Decomposing Gal with order
[2026-06-10 15:45:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:45:16] [INFO ] Removed a total of 95 redundant transitions.
[2026-06-10 15:45:16] [INFO ] Flatten gal took : 28 ms
[2026-06-10 15:45:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 8 ms.
[2026-06-10 15:45:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13628873859949258682.gal : 5 ms
[2026-06-10 15:45:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11732902825566738289.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13628873859949258682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11732902825566738289.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,964376,6.25293,139740,3758,4774,145149,129909,671,385781,326,802063,0
Converting to forward existential form...Done !
original formula: E(!(EG(((EF((i5.u24.loop_2_17>=1)) * A(A((u21.endloop_10_13>=1) U ((u21.busy_13_19>=1)&&(u21.testbusy_9_13>=1))) U (((u21.busy_13_19>=1)&...317
=> equivalent forward existential formula: [(FwdU(Init,!(EG(((E(TRUE U (i5.u24.loop_2_17>=1)) * !((E(!((((u21.busy_13_19>=1)&&(u21.testbusy_4_13>=1))||((i3...723
Reverse transition relation is NOT exact ! Due to transitions t115, t123, t130, t151, t158, t168, t171, t180, t215, t224, u15.t135, u15.t136, u15.t137, u15...460
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 351/351 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 293 transition count 336
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 293 transition count 336
Applied a total of 30 rules in 7 ms. Remains 293 /308 variables (removed 15) and now considering 336/351 (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-14020062961951144023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6177251902990448187.kers'
[2026-06-10 15:45:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14020062961951144023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6177251902990448187.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 336 rows 285 cols 918 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-10 15:45:46] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6177251902990448187.kers
Total runtime 4 ms.
[2026-06-10 15:45:46] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-06-10 15:45:46] [INFO ] Invariant cache hit.
[2026-06-10 15:45:47] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:45:48] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-06-10 15:45:48] [INFO ] Invariant cache hit.
[2026-06-10 15:45:48] [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, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/629 variables, and 64 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 11/293 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 9 (OVERLAPS) 336/629 variables, 293/368 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 326/774 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/629 variables, and 774 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 293/308 places, 336/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61677 ms. Remains : 293/308 places, 336/351 transitions.
[2026-06-10 15:46:48] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:46:48] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:46:48] [INFO ] Input system was already deterministic with 336 transitions.
[2026-06-10 15:46:48] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:46:48] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:46:48] [INFO ] Time to serialize gal into /tmp/CTLFireability5213301401467064783.gal : 3 ms
[2026-06-10 15:46:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3552255613956749653.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5213301401467064783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3552255613956749653.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5572e+06,6.72136,121120,2,46980,5,348108,6,0,1477,519503,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:47:18] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:47:18] [INFO ] Applying decomposition
[2026-06-10 15:47:18] [INFO ] Flatten gal took : 7 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/graph17422008296558608277.txt' '-o' '/tmp/graph17422008296558608277.bin' '-w' '/tmp/graph17422008296558608277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17422008296558608277.bin' '-l' '-1' '-v' '-w' '/tmp/graph17422008296558608277.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:47:18] [INFO ] Decomposing Gal with order
[2026-06-10 15:47:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:47:18] [INFO ] Removed a total of 324 redundant transitions.
[2026-06-10 15:47:18] [INFO ] Flatten gal took : 35 ms
[2026-06-10 15:47:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 7 ms.
[2026-06-10 15:47:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7701552046114542546.gal : 7 ms
[2026-06-10 15:47:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11982697528040777177.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7701552046114542546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11982697528040777177.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5572e+06,7.64623,189000,9720,26,262691,351,838,1.22916e+06,30,774,0
Converting to forward existential form...Done !
original formula: AF((((i2.u52.busy_17_19>=1)&&(i2.u68.testbusy_1_17>=1)) + (((i2.u89.beginloop_8_18>=1)&&(i3.i1.u81.lockb_18>=1)) * (!(E(((i1.u41.loop_8_1...408
=> equivalent forward existential formula: [FwdG(Init,!((((i2.u52.busy_17_19>=1)&&(i2.u68.testbusy_1_17>=1)) + (((i2.u89.beginloop_8_18>=1)&&(i3.i1.u81.loc...477
Reverse transition relation is NOT exact ! Due to transitions t182, t183, t195, t216, t217, t218, t220, t223, t231, t235, t237, t238, t242, t244, t249, t26...867
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 351/351 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 295 transition count 338
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 295 transition count 338
Applied a total of 26 rules in 6 ms. Remains 295 /308 variables (removed 13) and now considering 338/351 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7156903744614541439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1015911269512013327.kers'
[2026-06-10 15:47:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7156903744614541439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1015911269512013327.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 338 rows 287 cols 924 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-06-10 15:47:48] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1015911269512013327.kers
Total runtime 4 ms.
[2026-06-10 15:47:48] [INFO ] Implicit Places using invariants in 536 ms returned []
[2026-06-10 15:47:48] [INFO ] Invariant cache hit.
[2026-06-10 15:47:49] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:47:49] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2026-06-10 15:47:49] [INFO ] Invariant cache hit.
[2026-06-10 15:47:49] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 11/295 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
SMT process timed out in 30112ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30113ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 338/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31495 ms. Remains : 295/308 places, 338/351 transitions.
[2026-06-10 15:48:19] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:48:19] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:48:19] [INFO ] Input system was already deterministic with 338 transitions.
[2026-06-10 15:48:19] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:48:19] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:48:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13711800182115105907.gal : 1 ms
[2026-06-10 15:48:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16518066236969783496.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13711800182115105907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16518066236969783496.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5573e+06,5.94136,126728,2,50961,5,359310,6,0,1487,525402,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:48:50] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:48:50] [INFO ] Applying decomposition
[2026-06-10 15:48:50] [INFO ] Flatten gal took : 7 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/graph5510534958504424660.txt' '-o' '/tmp/graph5510534958504424660.bin' '-w' '/tmp/graph5510534958504424660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5510534958504424660.bin' '-l' '-1' '-v' '-w' '/tmp/graph5510534958504424660.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:48:50] [INFO ] Decomposing Gal with order
[2026-06-10 15:48:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:48:50] [INFO ] Removed a total of 324 redundant transitions.
[2026-06-10 15:48:50] [INFO ] Flatten gal took : 21 ms
[2026-06-10 15:48:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2026-06-10 15:48:50] [INFO ] Time to serialize gal into /tmp/CTLFireability13757445955175914484.gal : 6 ms
[2026-06-10 15:48:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15928396175337494765.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13757445955175914484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15928396175337494765.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5573e+06,10.7401,242292,10323,27,353660,324,841,1.49538e+06,29,719,0
Converting to forward existential form...Done !
original formula: E(!(((AX(((!(((i8.u17.initblock_3>=1)||(i6.u66.endloop_6_13>=1))) * EG(((i1.u0.beginloop_10_11>=1)&&(i1.u101.lockb_11>=1)))) * EX((i1.u51...323
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(((!(EX(!(((!(((i8.u17.initblock_3>=1)||(i6.u66.endloop_6_13>=1))) * EG(((i1.u0.beginloop_10_11...516
Reverse transition relation is NOT exact ! Due to transitions t182, t183, t187, t196, t198, t199, t201, t210, t211, t212, t216, t226, t229, t233, t245, t24...837
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 351/351 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 308 transition count 341
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 298 transition count 341
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 35 place count 283 transition count 326
Iterating global reduction 2 with 15 rules applied. Total rules applied 50 place count 283 transition count 326
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 224 place count 196 transition count 239
Applied a total of 224 rules in 25 ms. Remains 196 /308 variables (removed 112) and now considering 239/351 (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-3817475445772745822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8324055315345048370.kers'
[2026-06-10 15:49:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3817475445772745822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8324055315345048370.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 239 rows 188 cols 784 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-10 15:49:20] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8324055315345048370.kers
Total runtime 3 ms.
[2026-06-10 15:49:20] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-06-10 15:49:20] [INFO ] Invariant cache hit.
[2026-06-10 15:49:20] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:49:21] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2026-06-10 15:49:21] [INFO ] Redundant transitions in 1 ms returned []
Running 229 sub problems to find dead transitions.
[2026-06-10 15:49:21] [INFO ] Invariant cache hit.
[2026-06-10 15:49:21] [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, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 239/435 variables, 196/231 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 80/311 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 311 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 239/435 variables, 196/231 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 80/311 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 229/540 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 540 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/308 places, 239/351 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61632 ms. Remains : 196/308 places, 239/351 transitions.
[2026-06-10 15:50:21] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:50:21] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:50:21] [INFO ] Input system was already deterministic with 239 transitions.
[2026-06-10 15:50:21] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:50:21] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:50:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7201392829065473450.gal : 3 ms
[2026-06-10 15:50:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18334591672552007544.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7201392829065473450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18334591672552007544.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 20099 steps (5 resets) in 48 ms. (410 steps per ms) remains 0/1 properties
its-reach command run as :
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 351/351 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 294 transition count 337
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 294 transition count 337
Applied a total of 28 rules in 6 ms. Remains 294 /308 variables (removed 14) and now considering 337/351 (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-17160820637562571218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4998428964596054757.kers'
[2026-06-10 15:50:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17160820637562571218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4998428964596054757.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 337 rows 286 cols 921 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-10 15:50:21] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4998428964596054757.kers
Total runtime 5 ms.
[2026-06-10 15:50:22] [INFO ] Implicit Places using invariants in 448 ms returned []
[2026-06-10 15:50:22] [INFO ] Invariant cache hit.
[2026-06-10 15:50:22] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:50:23] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-06-10 15:50:23] [INFO ] Invariant cache hit.
[2026-06-10 15:50:23] [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, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 11/294 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 30111ms
Starting structural reductions in LTL mode, iteration 1 : 294/308 places, 337/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32032 ms. Remains : 294/308 places, 337/351 transitions.
[2026-06-10 15:50:53] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:50:53] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:50:53] [INFO ] Input system was already deterministic with 337 transitions.
[2026-06-10 15:50:54] [INFO ] Flatten gal took : 16 ms
[2026-06-10 15:50:54] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:50:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6417928505623251138.gal : 1 ms
[2026-06-10 15:50:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5222492354007133016.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6417928505623251138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5222492354007133016.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.55754e+06,6.75581,124840,2,42250,5,353024,6,0,1482,541195,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:51:24] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:51:24] [INFO ] Applying decomposition
[2026-06-10 15:51:24] [INFO ] Flatten gal took : 6 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/graph2717989184481988108.txt' '-o' '/tmp/graph2717989184481988108.bin' '-w' '/tmp/graph2717989184481988108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2717989184481988108.bin' '-l' '-1' '-v' '-w' '/tmp/graph2717989184481988108.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:51:24] [INFO ] Decomposing Gal with order
[2026-06-10 15:51:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:51:24] [INFO ] Removed a total of 323 redundant transitions.
[2026-06-10 15:51:24] [INFO ] Flatten gal took : 18 ms
[2026-06-10 15:51:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 2 ms.
[2026-06-10 15:51:24] [INFO ] Time to serialize gal into /tmp/CTLFireability7768872848770760874.gal : 5 ms
[2026-06-10 15:51:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16017778068157769745.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7768872848770760874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16017778068157769745.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.55754e+06,8.87208,226812,11929,22,315797,302,784,1.56189e+06,26,598,0
Converting to forward existential form...Done !
original formula: A((EX(EX(((i3.u33.loop_5_15<1) + EG((i6.u77.loop_1_16>=1))))) + E(((i0.u60.busy_12_19>=1)&&(i0.u18.testbusy_3_12>=1)) U E(EF((i1.u97.loop...327
=> equivalent forward existential formula: [((Init * !(EG(!(EG((EG((i2.u68.endloop_1_17>=1)) + E(TRUE U !(E(TRUE U !(((i4.u66.busy_16_20>=1)&&(i4.u39.testb...668
Reverse transition relation is NOT exact ! Due to transitions t198, t207, t212, t214, t221, t224, t227, t231, t234, t237, t240, t245, t249, t263, t265, t27...849
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 351/351 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 308 transition count 342
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 299 transition count 342
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 33 place count 284 transition count 327
Iterating global reduction 2 with 15 rules applied. Total rules applied 48 place count 284 transition count 327
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 224 place count 196 transition count 239
Applied a total of 224 rules in 26 ms. Remains 196 /308 variables (removed 112) and now considering 239/351 (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-5119238911829506651.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9625574413116393885.kers'
[2026-06-10 15:51:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5119238911829506651.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9625574413116393885.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 239 rows 188 cols 784 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-10 15:51:54] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9625574413116393885.kers
Total runtime 3 ms.
[2026-06-10 15:51:54] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-06-10 15:51:54] [INFO ] Invariant cache hit.
[2026-06-10 15:51:54] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:51:55] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2026-06-10 15:51:55] [INFO ] Redundant transitions in 0 ms returned []
Running 229 sub problems to find dead transitions.
[2026-06-10 15:51:55] [INFO ] Invariant cache hit.
[2026-06-10 15:51:55] [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, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 239/435 variables, 196/228 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 80/308 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 0/435 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 308 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 14 (OVERLAPS) 239/435 variables, 196/246 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 80/326 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/435 variables, 229/555 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 555 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/308 places, 239/351 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61251 ms. Remains : 196/308 places, 239/351 transitions.
[2026-06-10 15:52:55] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:52:55] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:52:55] [INFO ] Input system was already deterministic with 239 transitions.
[2026-06-10 15:52:55] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:52:55] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:52:55] [INFO ] Time to serialize gal into /tmp/CTLFireability2307419126387041441.gal : 2 ms
[2026-06-10 15:52:55] [INFO ] Time to serialize properties into /tmp/CTLFireability79509963339304251.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2307419126387041441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability79509963339304251.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,911927,3.58727,74764,2,15771,5,189410,6,0,992,284001,0
Converting to forward existential form...Done !
original formula: EG(AF((initblock_1>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((initblock_1>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t91, t92, t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, ...621
(forward)formula 0,0,29.8781,585728,1,0,593,2.67853e+06,505,245,7116,2.5861e+06,548
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 351/351 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 295 transition count 338
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 295 transition count 338
Applied a total of 26 rules in 7 ms. Remains 295 /308 variables (removed 13) and now considering 338/351 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6738676543818242610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14422715212194227723.kers'
[2026-06-10 15:53:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6738676543818242610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14422715212194227723.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 338 rows 287 cols 924 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-06-10 15:53:25] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14422715212194227723.kers
Total runtime 5 ms.
[2026-06-10 15:53:26] [INFO ] Implicit Places using invariants in 442 ms returned []
[2026-06-10 15:53:26] [INFO ] Invariant cache hit.
[2026-06-10 15:53:26] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:53:27] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2026-06-10 15:53:27] [INFO ] Invariant cache hit.
[2026-06-10 15:53:27] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 11/295 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 328 unsolved
SMT process timed out in 30184ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30188ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 338/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31914 ms. Remains : 295/308 places, 338/351 transitions.
[2026-06-10 15:53:57] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:53:57] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:53:57] [INFO ] Input system was already deterministic with 338 transitions.
[2026-06-10 15:53:57] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:53:57] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:53:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2527272533693394223.gal : 1 ms
[2026-06-10 15:53:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10009283466906401138.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2527272533693394223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10009283466906401138.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.63267e+06,6.56477,123588,2,41455,5,350907,6,0,1487,545095,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:54:27] [INFO ] Flatten gal took : 19 ms
[2026-06-10 15:54:27] [INFO ] Applying decomposition
[2026-06-10 15:54:27] [INFO ] Flatten gal took : 6 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/graph8588055077345416588.txt' '-o' '/tmp/graph8588055077345416588.bin' '-w' '/tmp/graph8588055077345416588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8588055077345416588.bin' '-l' '-1' '-v' '-w' '/tmp/graph8588055077345416588.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:54:27] [INFO ] Decomposing Gal with order
[2026-06-10 15:54:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:54:27] [INFO ] Removed a total of 323 redundant transitions.
[2026-06-10 15:54:27] [INFO ] Flatten gal took : 19 ms
[2026-06-10 15:54:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 5 ms.
[2026-06-10 15:54:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16789968620760186222.gal : 5 ms
[2026-06-10 15:54:27] [INFO ] Time to serialize properties into /tmp/CTLFireability18264406074027044349.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16789968620760186222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18264406074027044349.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.63267e+06,14.5264,312204,10731,29,425928,492,851,2.18207e+06,27,1555,0
Converting to forward existential form...Done !
original formula: E((AF(((i1.u57.endloop_2_17<1) * AF((i1.u57.endloop_2_14>=1)))) + ((i1.u59.beginloop_2_13>=1)&&(i2.i1.u95.lockb_13>=1))) U AX(((i6.u49.bu...197
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!(((i1.u57.endloop_2_17<1) * !(EG(!((i1.u57.endloop_2_14>=1)))))))) + ((i1.u59.beginloop_2_13>...261
Reverse transition relation is NOT exact ! Due to transitions t191, t205, t216, t219, t220, t237, t240, t249, t263, t265, t275, t285, t295, t297, t307, t31...885
(forward)formula 0,0,27.7327,436576,1,0,571726,492,4165,3.19831e+06,113,1555,1702094
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-06-10 15:54:55] [INFO ] Flatten gal took : 13 ms
[2026-06-10 15:54:55] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:54:55] [INFO ] Applying decomposition
[2026-06-10 15:54:55] [INFO ] Flatten gal took : 11 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/graph17477517554134411198.txt' '-o' '/tmp/graph17477517554134411198.bin' '-w' '/tmp/graph17477517554134411198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17477517554134411198.bin' '-l' '-1' '-v' '-w' '/tmp/graph17477517554134411198.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:54:55] [INFO ] Decomposing Gal with order
[2026-06-10 15:54:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:54:55] [INFO ] Removed a total of 269 redundant transitions.
[2026-06-10 15:54:55] [INFO ] Flatten gal took : 32 ms
[2026-06-10 15:54:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 7 ms.
[2026-06-10 15:54:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9744462733387040483.gal : 8 ms
[2026-06-10 15:54:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3112553881773438683.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9744462733387040483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3112553881773438683.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.80401e+06,7.65011,179696,9294,1237,226156,11744,877,1.1639e+06,221,68899,0
Converting to forward existential form...Done !
original formula: ((EG(((AG(((EX(((i1.u36.beginloop_7_12>=1)&&(i1.u60.lockb_12>=1))) * (i5.u47.busy_11_20>=1)) * (i9.u16.testbusy_3_11>=1))) * (i2.u51.busy...882
=> equivalent forward existential formula: (([FwdG(Init,((!(E(TRUE U !(((EX(((i1.u36.beginloop_7_12>=1)&&(i1.u60.lockb_12>=1))) * (i5.u47.busy_11_20>=1)) *...1034
Reverse transition relation is NOT exact ! Due to transitions t183, t191, t196, t207, t209, t216, t217, t220, t221, t222, t263, t285, t295, t317, t327, t32...845
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,82.1694,1564740,1,0,2.00039e+06,59506,5165,1.1266e+07,1099,289651,4798553
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG(((EX(!(E(((i2.u51.busy_15_20>=1)&&(i2.u94.testbusy_9_15>=1)) U (i9.u46.loop_9_18>=1)))) + (i7.u75.loop_8_14>=1)) + ((i7.u88.loop_6_14>...386
=> equivalent forward existential formula: [FwdG(Init,((EX(!(E(((i2.u51.busy_15_20>=1)&&(i2.u94.testbusy_9_15>=1)) U (i9.u46.loop_9_18>=1)))) + (i7.u75.loo...500
(forward)formula 1,1,95.5259,1711456,1,0,2.25402e+06,63230,5250,1.18699e+07,1100,301506,5218306
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(EX((EG(((i9.u46.beginloop_9_18<1)||(i9.u89.lockb_18<1))) * A(((i6.u22.loop_4_13<1)&&(i5.u1.loop_10_11<1)) U (AG(((i9.u53.busy_18_20>=1...246
=> equivalent forward existential formula: [(((EY(FwdU(Init,TRUE)) * EG(((i9.u46.beginloop_9_18<1)||(i9.u89.lockb_18<1)))) * !(EG(!((!(E(TRUE U !(((i9.u53....592
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 2,1,97.8378,1753728,1,0,2.30024e+06,71681,5430,1.21554e+07,1119,325948,5318401
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG(E((EF((i2.u63.loop_1_14>=1)) + ((i2.u51.busy_15_20>=1)&&(i2.u13.testbusy_2_15>=1))) U ((i2.u41.beginloop_8_15>=1)&&(i2.u94.lockb_15>=1...159
=> equivalent forward existential formula: [FwdG(Init,E((E(TRUE U (i2.u63.loop_1_14>=1)) + ((i2.u51.busy_15_20>=1)&&(i2.u13.testbusy_2_15>=1))) U ((i2.u41....208
(forward)formula 3,1,118.651,2120764,1,0,2.84212e+06,74081,5450,1.44126e+07,1119,335513,6372587
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E(!(EG(((EF((i10.u76.loop_2_17>=1)) * A(A((i6.u61.endloop_10_13>=1) U ((i6.u49.busy_13_19>=1)&&(i6.u77.testbusy_9_13>=1))) U (((i6.u49.bu...334
=> equivalent forward existential formula: [(FwdU(Init,!(EG(((E(TRUE U (i10.u76.loop_2_17>=1)) * !((E(!((((i6.u49.busy_13_19>=1)&&(i1.u83.testbusy_4_13>=1)...754
(forward)formula 4,1,157.843,2200704,1,0,2.91846e+06,74250,3998,1.50241e+07,696,336676,1903312
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AF((((i10.u76.busy_17_19>=1)&&(i10.u76.testbusy_1_17>=1)) + (((i9.u37.beginloop_8_18>=1)&&(i9.u89.lockb_18>=1)) * (!(E(((i6.u40.loop_8_13...402
=> equivalent forward existential formula: [FwdG(Init,!((((i10.u76.busy_17_19>=1)&&(i10.u76.testbusy_1_17>=1)) + (((i9.u37.beginloop_8_18>=1)&&(i9.u89.lock...471
(forward)formula 5,0,187.864,2200704,1,0,2.91846e+06,74250,4119,1.50241e+07,704,336676,3992462
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(!(((AX(((!(((i7.u56.initblock_3>=1)||(i6.u61.endloop_6_13>=1))) * EG(((i5.u0.beginloop_10_11>=1)&&(i5.u59.lockb_11>=1)))) * EX((u43.ini...318
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(((!(EX(!(((!(((i7.u56.initblock_3>=1)||(i6.u61.endloop_6_13>=1))) * EG(((i5.u0.beginloop_10_11...511
(forward)formula 6,0,188.715,2200704,1,0,2.91846e+06,74250,4181,1.50241e+07,705,336676,4102081
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A((EX(EX(((i3.u29.loop_5_15<1) + EG((i3.u9.loop_1_16>=1))))) + E(((i1.u48.busy_12_19>=1)&&(i1.u66.testbusy_3_12>=1)) U E(EF((i5.u1.loop_1...326
=> equivalent forward existential formula: [((Init * !(EG(!(EG((EG((i10.u76.endloop_1_17>=1)) + E(TRUE U !(E(TRUE U !(((i3.u52.busy_16_20>=1)&&(i3.u72.test...669
(forward)formula 7,0,194.86,2200704,1,0,2.91846e+06,74250,4248,1.50241e+07,706,336676,4604476
FORMULA FileSystem-PT-N03I10B08-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1784890 ms.
BK_STOP 1781107091653
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="CTLFireability"
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 CTLFireability"
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-178021499300434"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;