About the Execution of ITS-Tools for CloudReconfiguration-PT-301
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16196.640 | 3600000.00 | 3258656.00 | 396926.40 | TT?FTFTF?TT??TTT | 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.r066-tall-177946967500114.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 CloudReconfiguration-PT-301, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967500114
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.2K Mar 6 08:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 6 08:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 6 08:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 08:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 08:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Mar 6 08:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 08:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 08:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 660K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-301-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779496729771
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-301
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 00:38:50] [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-05-23 00:38:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 00:38:51] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2026-05-23 00:38:51] [INFO ] Transformed 2584 places.
[2026-05-23 00:38:51] [INFO ] Transformed 3094 transitions.
[2026-05-23 00:38:51] [INFO ] Found NUPN structural information;
[2026-05-23 00:38:51] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 114 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 499 places :
Symmetric choice reduction at 0 with 499 rule applications. Total rules 499 place count 2085 transition count 2595
Iterating global reduction 0 with 499 rules applied. Total rules applied 998 place count 2085 transition count 2595
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1027 place count 2085 transition count 2566
Discarding 220 places :
Symmetric choice reduction at 1 with 220 rule applications. Total rules 1247 place count 1865 transition count 2346
Iterating global reduction 1 with 220 rules applied. Total rules applied 1467 place count 1865 transition count 2346
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 1546 place count 1786 transition count 2267
Iterating global reduction 1 with 79 rules applied. Total rules applied 1625 place count 1786 transition count 2267
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 1638 place count 1786 transition count 2254
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1683 place count 1741 transition count 2209
Iterating global reduction 2 with 45 rules applied. Total rules applied 1728 place count 1741 transition count 2209
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1736 place count 1741 transition count 2201
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1767 place count 1710 transition count 2168
Iterating global reduction 3 with 31 rules applied. Total rules applied 1798 place count 1710 transition count 2168
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1820 place count 1688 transition count 2146
Iterating global reduction 3 with 22 rules applied. Total rules applied 1842 place count 1688 transition count 2146
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1862 place count 1668 transition count 2126
Iterating global reduction 3 with 20 rules applied. Total rules applied 1882 place count 1668 transition count 2126
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1901 place count 1649 transition count 2107
Iterating global reduction 3 with 19 rules applied. Total rules applied 1920 place count 1649 transition count 2107
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1935 place count 1634 transition count 2083
Iterating global reduction 3 with 15 rules applied. Total rules applied 1950 place count 1634 transition count 2083
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1954 place count 1630 transition count 2077
Iterating global reduction 3 with 4 rules applied. Total rules applied 1958 place count 1630 transition count 2077
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1962 place count 1626 transition count 2072
Iterating global reduction 3 with 4 rules applied. Total rules applied 1966 place count 1626 transition count 2072
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1967 place count 1626 transition count 2071
Applied a total of 1967 rules in 1410 ms. Remains 1626 /2584 variables (removed 958) and now considering 2071/3094 (removed 1023) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16103622354407502617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1712137821510470562.kers'
[2026-05-23 00:38:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16103622354407502617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1712137821510470562.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2071 rows 1626 cols 4321 entries
Finished phase 1 with 1621 SingleSign rule and 1 generalized
[2026-05-23 00:38:52] [INFO ] Computed 4 invariants in 10 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-1712137821510470562.kers
Total runtime 13 ms.
[2026-05-23 00:38:53] [INFO ] Implicit Places using invariants in 586 ms returned []
[2026-05-23 00:38:53] [INFO ] Invariant cache hit.
[2026-05-23 00:38:54] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 1839 ms to find 0 implicit places.
Running 2070 sub problems to find dead transitions.
[2026-05-23 00:38:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1625 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2070 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1625/3697 variables, and 4 constraints, problems are : Problem set: 0 solved, 2070 unsolved in 30066 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1626 constraints, PredecessorRefiner: 2070/2070 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2070 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1625 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2070 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1625/3697 variables, and 4 constraints, problems are : Problem set: 0 solved, 2070 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1626 constraints, PredecessorRefiner: 0/2070 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 2070 unsolved
Search for dead transitions found 0 dead transitions in 60726ms
Starting structural reductions in LTL mode, iteration 1 : 1626/2584 places, 2071/3094 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64033 ms. Remains : 1626/2584 places, 2071/3094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Applied a total of 0 rules in 60 ms. Remains 1626 /1626 variables (removed 0) and now considering 2071/2071 (removed 0) transitions.
[2026-05-23 00:39:55] [INFO ] Invariant cache hit.
[2026-05-23 00:39:55] [INFO ] Implicit Places using invariants in 273 ms returned []
[2026-05-23 00:39:55] [INFO ] Invariant cache hit.
[2026-05-23 00:39:56] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1340 ms. Remains : 1626/1626 places, 2071/2071 transitions.
Support contains 114 out of 1626 places after structural reductions.
[2026-05-23 00:39:57] [INFO ] Flatten gal took : 127 ms
[2026-05-23 00:39:57] [INFO ] Flatten gal took : 69 ms
[2026-05-23 00:39:57] [INFO ] Input system was already deterministic with 2071 transitions.
Support contains 113 out of 1626 places (down from 114) after GAL structural reductions.
RANDOM walk for 40000 steps (304 resets) in 1473 ms. (27 steps per ms) remains 55/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (9 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (9 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (9 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
[2026-05-23 00:39:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1527/1615 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1615 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 2061/3676 variables, 1615/1619 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3676 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 2/3678 variables, 1/1620 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3678/3697 variables, and 1620 constraints, problems are : Problem set: 0 solved, 55 unsolved in 5022 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1616/1626 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1527/1615 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1615 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 2061/3676 variables, 1615/1619 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3676 variables, 55/1674 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3676/3697 variables, and 1674 constraints, problems are : Problem set: 0 solved, 55 unsolved in 5025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1615/1626 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10080ms problems are : Problem set: 0 solved, 55 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 1626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Graph (trivial) has 1785 edges and 1626 vertex of which 536 / 1626 are part of one of the 56 SCC in 18 ms
Free SCC test removed 480 places
Drop transitions (Empty/Sink Transition effects.) removed 595 transitions
Reduce isomorphic transitions removed 595 transitions.
Graph (complete) has 1657 edges and 1146 vertex of which 1137 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 510 rules applied. Total rules applied 512 place count 1137 transition count 962
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 543 rules applied. Total rules applied 1055 place count 633 transition count 923
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 1082 place count 609 transition count 920
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1085 place count 608 transition count 918
Reduce places removed 1 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 4 with 40 rules applied. Total rules applied 1125 place count 607 transition count 879
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 42 rules applied. Total rules applied 1167 place count 568 transition count 876
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1168 place count 567 transition count 876
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 65 Pre rules applied. Total rules applied 1168 place count 567 transition count 811
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 7 with 130 rules applied. Total rules applied 1298 place count 502 transition count 811
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1304 place count 496 transition count 804
Iterating global reduction 7 with 6 rules applied. Total rules applied 1310 place count 496 transition count 804
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1310 place count 496 transition count 803
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1312 place count 495 transition count 803
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1317 place count 490 transition count 798
Iterating global reduction 7 with 5 rules applied. Total rules applied 1322 place count 490 transition count 798
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1326 place count 490 transition count 794
Performed 193 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 193 places in 1 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 8 with 386 rules applied. Total rules applied 1712 place count 297 transition count 521
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1739 place count 297 transition count 494
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1741 place count 295 transition count 492
Iterating global reduction 9 with 2 rules applied. Total rules applied 1743 place count 295 transition count 492
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1753 place count 290 transition count 487
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1762 place count 290 transition count 478
Performed 47 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 10 with 94 rules applied. Total rules applied 1856 place count 243 transition count 534
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 10 with 33 rules applied. Total rules applied 1889 place count 243 transition count 501
Discarding 14 places :
Symmetric choice reduction at 11 with 14 rule applications. Total rules 1903 place count 229 transition count 473
Iterating global reduction 11 with 14 rules applied. Total rules applied 1917 place count 229 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1918 place count 229 transition count 472
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1919 place count 228 transition count 470
Iterating global reduction 12 with 1 rules applied. Total rules applied 1920 place count 228 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 12 with 29 rules applied. Total rules applied 1949 place count 228 transition count 441
Free-agglomeration rule applied 8 times.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1957 place count 228 transition count 433
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 1965 place count 220 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1966 place count 220 transition count 432
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1987 place count 220 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1988 place count 220 transition count 431
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 1992 place count 220 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1993 place count 219 transition count 430
Applied a total of 1993 rules in 272 ms. Remains 219 /1626 variables (removed 1407) and now considering 430/2071 (removed 1641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 219/1626 places, 430/2071 transitions.
RANDOM walk for 40000 steps (3071 resets) in 595 ms. (67 steps per ms) remains 12/55 properties
BEST_FIRST walk for 40003 steps (625 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (596 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (464 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (67 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (633 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (608 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (619 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (618 resets) in 55 ms. (714 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (607 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (622 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (598 resets) in 34 ms. (1142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (618 resets) in 95 ms. (416 steps per ms) remains 10/11 properties
[2026-05-23 00:40:09] [INFO ] Flow matrix only has 423 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11229082971810324828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10157176550093733995.kers'
[2026-05-23 00:40:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11229082971810324828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10157176550093733995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 423 rows 219 cols 1139 entries
Finished phase 1 with 216 SingleSign rule and 0 generalized
[2026-05-23 00:40:09] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10157176550093733995.kers
Total runtime 2 ms.
[2026-05-23 00:40:09] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 154/181 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 379/560 variables, 181/184 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 3/187 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 46/606 variables, 18/205 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 2/207 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 0/207 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 30/636 variables, 14/221 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 0/221 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 11 (OVERLAPS) 6/642 variables, 6/227 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 0/227 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/642 variables, 0/227 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 227 constraints, problems are : Problem set: 3 solved, 7 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 219/219 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 160/179 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 372/551 variables, 179/182 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 3/185 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 3/188 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/188 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 50/601 variables, 17/205 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 2/207 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 3/210 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 0/210 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 34/635 variables, 16/226 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 0/226 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 7/642 variables, 7/233 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/642 variables, 0/233 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/642 variables, 0/233 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 233 constraints, problems are : Problem set: 4 solved, 6 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 219/219 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1498ms problems are : Problem set: 4 solved, 6 unsolved
Parikh walk visited 4 properties in 397 ms.
Support contains 6 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 430/430 transitions.
Graph (trivial) has 257 edges and 219 vertex of which 67 / 219 are part of one of the 26 SCC in 1 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 178 transition count 320
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 144 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 143 transition count 318
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 72 place count 143 transition count 308
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 92 place count 133 transition count 308
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 106 place count 119 transition count 287
Iterating global reduction 3 with 14 rules applied. Total rules applied 120 place count 119 transition count 287
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 126 place count 119 transition count 281
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 129 place count 116 transition count 276
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 116 transition count 276
Performed 23 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 178 place count 93 transition count 242
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 190 place count 93 transition count 230
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 193 place count 90 transition count 225
Iterating global reduction 5 with 3 rules applied. Total rules applied 196 place count 90 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 197 place count 90 transition count 224
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 203 place count 87 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 206 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 207 place count 86 transition count 216
Iterating global reduction 7 with 1 rules applied. Total rules applied 208 place count 86 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 209 place count 86 transition count 215
Performed 14 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 237 place count 72 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 8 with 46 rules applied. Total rules applied 283 place count 72 transition count 184
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 291 place count 64 transition count 167
Iterating global reduction 9 with 8 rules applied. Total rules applied 299 place count 64 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 304 place count 64 transition count 162
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 307 place count 61 transition count 158
Iterating global reduction 10 with 3 rules applied. Total rules applied 310 place count 61 transition count 158
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 315 place count 61 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 11 with 24 rules applied. Total rules applied 339 place count 61 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 339 place count 61 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 341 place count 60 transition count 128
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 342 place count 59 transition count 125
Iterating global reduction 11 with 1 rules applied. Total rules applied 343 place count 59 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 344 place count 59 transition count 124
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 345 place count 58 transition count 123
Iterating global reduction 12 with 1 rules applied. Total rules applied 346 place count 58 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 348 place count 57 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 350 place count 57 transition count 120
Free-agglomeration rule applied 6 times.
Iterating global reduction 12 with 6 rules applied. Total rules applied 356 place count 57 transition count 114
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 365 place count 51 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 366 place count 51 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 367 place count 51 transition count 110
Applied a total of 367 rules in 52 ms. Remains 51 /219 variables (removed 168) and now considering 110/430 (removed 320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 51/219 places, 110/430 transitions.
RANDOM walk for 40000 steps (934 resets) in 141 ms. (281 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (284 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2026-05-23 00:40:11] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2597142969738205901.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13122136958900936208.kers'
[2026-05-23 00:40:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2597142969738205901.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13122136958900936208.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 51 cols 320 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-23 00:40:11] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13122136958900936208.kers
Total runtime 0 ms.
[2026-05-23 00:40:11] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp43 is UNSAT
After SMT solving in domain Real declared 35/153 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, State Equation: 0/51 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 00:40:11] [INFO ] Flatten gal took : 55 ms
[2026-05-23 00:40:11] [INFO ] Flatten gal took : 53 ms
[2026-05-23 00:40:11] [INFO ] Input system was already deterministic with 2071 transitions.
Support contains 89 out of 1626 places (down from 90) after GAL structural reductions.
Computed a total of 28 stabilizing places and 30 stable transitions
Graph (complete) has 2255 edges and 1626 vertex of which 1617 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.21 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Graph (trivial) has 1970 edges and 1626 vertex of which 693 / 1626 are part of one of the 61 SCC in 3 ms
Free SCC test removed 632 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1514 edges and 994 vertex of which 985 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 550 transitions
Trivial Post-agglo rules discarded 550 transitions
Performed 550 trivial Post agglomeration. Transition count delta: 550
Iterating post reduction 0 with 550 rules applied. Total rules applied 552 place count 984 transition count 780
Reduce places removed 550 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 575 rules applied. Total rules applied 1127 place count 434 transition count 755
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 1141 place count 423 transition count 752
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 1145 place count 421 transition count 750
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1147 place count 419 transition count 750
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 45 Pre rules applied. Total rules applied 1147 place count 419 transition count 705
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1237 place count 374 transition count 705
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1259 place count 352 transition count 674
Iterating global reduction 5 with 22 rules applied. Total rules applied 1281 place count 352 transition count 674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1284 place count 352 transition count 671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1285 place count 351 transition count 671
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1285 place count 351 transition count 670
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1287 place count 350 transition count 670
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1301 place count 336 transition count 653
Iterating global reduction 7 with 14 rules applied. Total rules applied 1315 place count 336 transition count 653
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 10 rules applied. Total rules applied 1325 place count 336 transition count 643
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1327 place count 334 transition count 643
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1328 place count 333 transition count 641
Iterating global reduction 9 with 1 rules applied. Total rules applied 1329 place count 333 transition count 641
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1330 place count 332 transition count 639
Iterating global reduction 9 with 1 rules applied. Total rules applied 1331 place count 332 transition count 639
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1332 place count 331 transition count 637
Iterating global reduction 9 with 1 rules applied. Total rules applied 1333 place count 331 transition count 637
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1334 place count 330 transition count 635
Iterating global reduction 9 with 1 rules applied. Total rules applied 1335 place count 330 transition count 635
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 84 rules applied. Total rules applied 1419 place count 288 transition count 593
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 9 with 28 rules applied. Total rules applied 1447 place count 288 transition count 565
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 11 rules applied. Total rules applied 1458 place count 279 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1459 place count 278 transition count 563
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 1471 place count 266 transition count 541
Iterating global reduction 12 with 12 rules applied. Total rules applied 1483 place count 266 transition count 541
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1492 place count 257 transition count 523
Iterating global reduction 12 with 9 rules applied. Total rules applied 1501 place count 257 transition count 523
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1502 place count 256 transition count 521
Iterating global reduction 12 with 1 rules applied. Total rules applied 1503 place count 256 transition count 521
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1504 place count 255 transition count 519
Iterating global reduction 12 with 1 rules applied. Total rules applied 1505 place count 255 transition count 519
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1506 place count 254 transition count 517
Iterating global reduction 12 with 1 rules applied. Total rules applied 1507 place count 254 transition count 517
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1508 place count 253 transition count 515
Iterating global reduction 12 with 1 rules applied. Total rules applied 1509 place count 253 transition count 515
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1510 place count 252 transition count 513
Iterating global reduction 12 with 1 rules applied. Total rules applied 1511 place count 252 transition count 513
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1512 place count 251 transition count 508
Iterating global reduction 12 with 1 rules applied. Total rules applied 1513 place count 251 transition count 508
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1521 place count 247 transition count 504
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 6 rules applied. Total rules applied 1527 place count 247 transition count 498
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1529 place count 245 transition count 498
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1533 place count 241 transition count 490
Iterating global reduction 14 with 4 rules applied. Total rules applied 1537 place count 241 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1538 place count 241 transition count 489
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 15 with 75 rules applied. Total rules applied 1613 place count 241 transition count 414
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 30 rules applied. Total rules applied 1643 place count 241 transition count 384
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 31 rules applied. Total rules applied 1674 place count 211 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1675 place count 210 transition count 383
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 3 Pre rules applied. Total rules applied 1675 place count 210 transition count 380
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 18 with 6 rules applied. Total rules applied 1681 place count 207 transition count 380
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 18 with 10 rules applied. Total rules applied 1691 place count 202 transition count 375
Discarding 3 places :
Symmetric choice reduction at 18 with 3 rule applications. Total rules 1694 place count 199 transition count 372
Iterating global reduction 18 with 3 rules applied. Total rules applied 1697 place count 199 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 18 with 7 rules applied. Total rules applied 1704 place count 199 transition count 365
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1705 place count 198 transition count 364
Applied a total of 1705 rules in 177 ms. Remains 198 /1626 variables (removed 1428) and now considering 364/2071 (removed 1707) transitions.
[2026-05-23 00:40:11] [INFO ] Flow matrix only has 315 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16481303396014891385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1776363627680353895.kers'
[2026-05-23 00:40:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16481303396014891385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1776363627680353895.kers]
Normalized transition count is 314 out of 315 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 198 cols 746 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-23 00:40:11] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1776363627680353895.kers
Total runtime 1 ms.
[2026-05-23 00:40:11] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-23 00:40:11] [INFO ] Flow matrix only has 315 transitions (discarded 49 similar events)
[2026-05-23 00:40:11] [INFO ] Invariant cache hit.
[2026-05-23 00:40:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 00:40:11] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [15, 73, 193]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 271 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 195/1626 places, 364/2071 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 192 transition count 361
Applied a total of 3 rules in 17 ms. Remains 192 /195 variables (removed 3) and now considering 361/364 (removed 3) transitions.
[2026-05-23 00:40:11] [INFO ] Flow matrix only has 312 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1792004310972813175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4119216137702849052.kers'
[2026-05-23 00:40:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1792004310972813175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4119216137702849052.kers]
Normalized transition count is 311 out of 312 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 192 cols 731 entries
Finished phase 1 with 192 SingleSign rule and 0 generalized
[2026-05-23 00:40:11] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4119216137702849052.kers
Total runtime 1 ms.
[2026-05-23 00:40:12] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 00:40:12] [INFO ] Flow matrix only has 312 transitions (discarded 49 similar events)
[2026-05-23 00:40:12] [INFO ] Invariant cache hit.
[2026-05-23 00:40:12] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 192/1626 places, 361/2071 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 618 ms. Remains : 192/1626 places, 361/2071 transitions.
[2026-05-23 00:40:12] [INFO ] Flatten gal took : 7 ms
[2026-05-23 00:40:12] [INFO ] Flatten gal took : 7 ms
[2026-05-23 00:40:12] [INFO ] Input system was already deterministic with 361 transitions.
[2026-05-23 00:40:12] [INFO ] Flatten gal took : 6 ms
[2026-05-23 00:40:12] [INFO ] Flatten gal took : 10 ms
[2026-05-23 00:40:12] [INFO ] Time to serialize gal into /tmp/CTLFireability18278036338639427220.gal : 9 ms
[2026-05-23 00:40:12] [INFO ] Time to serialize properties into /tmp/CTLFireability12154750796154243226.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/CTLFireability18278036338639427220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12154750796154243226.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.73532e+06,0.238149,12576,2,1890,5,30907,6,0,1073,40759,0
Converting to forward existential form...Done !
original formula: EG(EF(((p1586==1)||(((p2295==1)&&(p62==1))&&(p88==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p1586==1)||(((p2295==1)&&(p62==1))&&(p88==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t11, t12, t14, t28, t30, t54, t60, t63, t68, t69, t70, t84, t108, t114, t117, t122, t...518
(forward)formula 0,1,10.4534,314840,1,0,585,1.47412e+06,699,353,6484,2.0089e+06,808
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1580 transition count 2022
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1580 transition count 2022
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 1580 transition count 2021
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 120 place count 1553 transition count 1993
Iterating global reduction 1 with 27 rules applied. Total rules applied 147 place count 1553 transition count 1993
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 153 place count 1553 transition count 1987
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 1542 transition count 1973
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 1542 transition count 1973
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 184 place count 1533 transition count 1961
Iterating global reduction 2 with 9 rules applied. Total rules applied 193 place count 1533 transition count 1961
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 1526 transition count 1953
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 1526 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 208 place count 1526 transition count 1952
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 213 place count 1521 transition count 1946
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 1521 transition count 1946
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 223 place count 1516 transition count 1941
Iterating global reduction 3 with 5 rules applied. Total rules applied 228 place count 1516 transition count 1941
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 232 place count 1512 transition count 1936
Iterating global reduction 3 with 4 rules applied. Total rules applied 236 place count 1512 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 239 place count 1509 transition count 1931
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 243 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 244 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 1507 transition count 1929
Applied a total of 246 rules in 793 ms. Remains 1507 /1626 variables (removed 119) and now considering 1929/2071 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14751418976959486952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18320788077293411373.kers'
[2026-05-23 00:40:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14751418976959486952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18320788077293411373.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1929 rows 1507 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 00:40:23] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-18320788077293411373.kers
Total runtime 12 ms.
[2026-05-23 00:40:23] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-23 00:40:23] [INFO ] Invariant cache hit.
[2026-05-23 00:40:24] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 00:40:24] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60461ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1626 places, 1929/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62375 ms. Remains : 1507/1626 places, 1929/2071 transitions.
[2026-05-23 00:41:25] [INFO ] Flatten gal took : 27 ms
[2026-05-23 00:41:25] [INFO ] Flatten gal took : 27 ms
[2026-05-23 00:41:25] [INFO ] Input system was already deterministic with 1929 transitions.
[2026-05-23 00:41:25] [INFO ] Flatten gal took : 27 ms
[2026-05-23 00:41:25] [INFO ] Flatten gal took : 26 ms
[2026-05-23 00:41:25] [INFO ] Time to serialize gal into /tmp/CTLFireability603211142587386427.gal : 22 ms
[2026-05-23 00:41:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16324004761613566114.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/CTLFireability603211142587386427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16324004761613566114.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,1.61338e+10,12.9592,275484,2,27234,5,745009,6,0,7959,1.37643e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:41:55] [INFO ] Flatten gal took : 22 ms
[2026-05-23 00:41:55] [INFO ] Applying decomposition
[2026-05-23 00:41:55] [INFO ] Flatten gal took : 22 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/graph15171989217095345796.txt' '-o' '/tmp/graph15171989217095345796.bin' '-w' '/tmp/graph15171989217095345796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15171989217095345796.bin' '-l' '-1' '-v' '-w' '/tmp/graph15171989217095345796.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:41:55] [INFO ] Decomposing Gal with order
[2026-05-23 00:41:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:41:55] [INFO ] Removed a total of 527 redundant transitions.
[2026-05-23 00:41:56] [INFO ] Flatten gal took : 134 ms
[2026-05-23 00:41:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 36 ms.
[2026-05-23 00:41:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13393437561811376970.gal : 21 ms
[2026-05-23 00:41:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5731494526679700100.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/CTLFireability13393437561811376970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5731494526679700100.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,1.61338e+10,0.838881,30312,1927,230,41573,4803,2512,76270,114,26872,0
Converting to forward existential form...Done !
original formula: (EX(AX((i30.u504.p2075==0))) * EF(EG((i10.u166.p749==1))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * EX(!(EX(!((i30.u504.p2075==0)))))),TRUE),(i10.u166.p749==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t260, t291, t320, t370, t441, t493, t675, t727, t787, t836, t907, t958, t1111, t11...2149
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
(forward)formula 0,1,5.42085,194500,1,0,328993,7282,23886,726632,509,39568,1565635
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 1584 transition count 2026
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 1584 transition count 2026
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1584 transition count 2025
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 108 place count 1561 transition count 2001
Iterating global reduction 1 with 23 rules applied. Total rules applied 131 place count 1561 transition count 2001
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 136 place count 1561 transition count 1996
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 145 place count 1552 transition count 1984
Iterating global reduction 2 with 9 rules applied. Total rules applied 154 place count 1552 transition count 1984
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 162 place count 1544 transition count 1973
Iterating global reduction 2 with 8 rules applied. Total rules applied 170 place count 1544 transition count 1973
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 176 place count 1538 transition count 1967
Iterating global reduction 2 with 6 rules applied. Total rules applied 182 place count 1538 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 183 place count 1538 transition count 1966
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 187 place count 1534 transition count 1962
Iterating global reduction 3 with 4 rules applied. Total rules applied 191 place count 1534 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 195 place count 1530 transition count 1958
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 1530 transition count 1958
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 203 place count 1526 transition count 1953
Iterating global reduction 3 with 4 rules applied. Total rules applied 207 place count 1526 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 210 place count 1523 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 1523 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 214 place count 1522 transition count 1947
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 1522 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 216 place count 1521 transition count 1946
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 1521 transition count 1946
Applied a total of 217 rules in 725 ms. Remains 1521 /1626 variables (removed 105) and now considering 1946/2071 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6199767324067391438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16239332235819858365.kers'
[2026-05-23 00:42:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6199767324067391438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16239332235819858365.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1946 rows 1521 cols 4061 entries
Finished phase 1 with 1516 SingleSign rule and 1 generalized
[2026-05-23 00:42:02] [INFO ] Computed 4 invariants in 18 ms
Computed 4 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-16239332235819858365.kers
Total runtime 22 ms.
[2026-05-23 00:42:02] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-23 00:42:02] [INFO ] Invariant cache hit.
[2026-05-23 00:42:03] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
Running 1945 sub problems to find dead transitions.
[2026-05-23 00:42:03] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1521 constraints, PredecessorRefiner: 1945/1945 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1945 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1521 constraints, PredecessorRefiner: 0/1945 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 1945 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Starting structural reductions in LTL mode, iteration 1 : 1521/1626 places, 1946/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62354 ms. Remains : 1521/1626 places, 1946/2071 transitions.
[2026-05-23 00:43:04] [INFO ] Flatten gal took : 24 ms
[2026-05-23 00:43:04] [INFO ] Flatten gal took : 23 ms
[2026-05-23 00:43:04] [INFO ] Input system was already deterministic with 1946 transitions.
[2026-05-23 00:43:04] [INFO ] Flatten gal took : 23 ms
[2026-05-23 00:43:04] [INFO ] Flatten gal took : 29 ms
[2026-05-23 00:43:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16688397278073577385.gal : 7 ms
[2026-05-23 00:43:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2136923296417691418.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/CTLFireability16688397278073577385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2136923296417691418.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.66862e+10,11.9769,262820,2,26967,5,682249,6,0,8032,1.35132e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:43:34] [INFO ] Flatten gal took : 21 ms
[2026-05-23 00:43:34] [INFO ] Applying decomposition
[2026-05-23 00:43:34] [INFO ] Flatten gal took : 21 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/graph1657476877999515069.txt' '-o' '/tmp/graph1657476877999515069.bin' '-w' '/tmp/graph1657476877999515069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1657476877999515069.bin' '-l' '-1' '-v' '-w' '/tmp/graph1657476877999515069.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:43:34] [INFO ] Decomposing Gal with order
[2026-05-23 00:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:43:34] [INFO ] Removed a total of 516 redundant transitions.
[2026-05-23 00:43:34] [INFO ] Flatten gal took : 61 ms
[2026-05-23 00:43:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 23 ms.
[2026-05-23 00:43:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15285210782671026940.gal : 14 ms
[2026-05-23 00:43:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7005981227884246041.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/CTLFireability15285210782671026940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7005981227884246041.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,1.66862e+10,1.00093,37068,2101,241,56624,5081,2467,103697,123,32500,0
Converting to forward existential form...Done !
original formula: A(E((i39.i0.i1.u608.p2549==1) U ((AX(((i21.i2.i1.u293.p1291==1)||(i26.i0.i1.u348.p1464==1))) * AX(((i8.u86.p512==1)||(i16.u207.p904==1)))...443
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((EG((((i32.i0.i3.u485.p2028==1)||(i5.u45.p270==1))||(i9.i0.i0.u83.p503==1))) * (!(E(TRUE...1094
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t208, t261, t321, t370, t441, t493, t655, t684, t736, t798, t847, t918, t969, t112...2133
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Graph (trivial) has 1963 edges and 1626 vertex of which 706 / 1626 are part of one of the 62 SCC in 2 ms
Free SCC test removed 644 places
Ensure Unique test removed 749 transitions
Reduce isomorphic transitions removed 749 transitions.
Graph (complete) has 1500 edges and 982 vertex of which 973 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 539 rules applied. Total rules applied 541 place count 972 transition count 777
Reduce places removed 539 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 1 with 562 rules applied. Total rules applied 1103 place count 433 transition count 754
Reduce places removed 10 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 16 rules applied. Total rules applied 1119 place count 423 transition count 748
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1125 place count 417 transition count 748
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 1125 place count 417 transition count 705
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1211 place count 374 transition count 705
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 1233 place count 352 transition count 674
Iterating global reduction 4 with 22 rules applied. Total rules applied 1255 place count 352 transition count 674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1258 place count 352 transition count 671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1259 place count 351 transition count 671
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1259 place count 351 transition count 670
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1261 place count 350 transition count 670
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1275 place count 336 transition count 653
Iterating global reduction 6 with 14 rules applied. Total rules applied 1289 place count 336 transition count 653
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 10 rules applied. Total rules applied 1299 place count 336 transition count 643
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1301 place count 334 transition count 643
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1302 place count 333 transition count 641
Iterating global reduction 8 with 1 rules applied. Total rules applied 1303 place count 333 transition count 641
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1304 place count 332 transition count 639
Iterating global reduction 8 with 1 rules applied. Total rules applied 1305 place count 332 transition count 639
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1306 place count 331 transition count 637
Iterating global reduction 8 with 1 rules applied. Total rules applied 1307 place count 331 transition count 637
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1308 place count 330 transition count 635
Iterating global reduction 8 with 1 rules applied. Total rules applied 1309 place count 330 transition count 635
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 84 rules applied. Total rules applied 1393 place count 288 transition count 593
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 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 8 with 29 rules applied. Total rules applied 1422 place count 288 transition count 564
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 11 rules applied. Total rules applied 1433 place count 279 transition count 562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1434 place count 278 transition count 562
Discarding 13 places :
Symmetric choice reduction at 11 with 13 rule applications. Total rules 1447 place count 265 transition count 538
Iterating global reduction 11 with 13 rules applied. Total rules applied 1460 place count 265 transition count 538
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1469 place count 256 transition count 520
Iterating global reduction 11 with 9 rules applied. Total rules applied 1478 place count 256 transition count 520
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1479 place count 255 transition count 518
Iterating global reduction 11 with 1 rules applied. Total rules applied 1480 place count 255 transition count 518
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1481 place count 254 transition count 516
Iterating global reduction 11 with 1 rules applied. Total rules applied 1482 place count 254 transition count 516
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1483 place count 253 transition count 514
Iterating global reduction 11 with 1 rules applied. Total rules applied 1484 place count 253 transition count 514
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1485 place count 252 transition count 512
Iterating global reduction 11 with 1 rules applied. Total rules applied 1486 place count 252 transition count 512
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1487 place count 251 transition count 510
Iterating global reduction 11 with 1 rules applied. Total rules applied 1488 place count 251 transition count 510
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1489 place count 250 transition count 505
Iterating global reduction 11 with 1 rules applied. Total rules applied 1490 place count 250 transition count 505
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1498 place count 246 transition count 501
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1504 place count 246 transition count 495
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1506 place count 244 transition count 495
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1509 place count 241 transition count 489
Iterating global reduction 13 with 3 rules applied. Total rules applied 1512 place count 241 transition count 489
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1513 place count 240 transition count 487
Iterating global reduction 13 with 1 rules applied. Total rules applied 1514 place count 240 transition count 487
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1515 place count 239 transition count 483
Iterating global reduction 13 with 1 rules applied. Total rules applied 1516 place count 239 transition count 483
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 13 with 74 rules applied. Total rules applied 1590 place count 239 transition count 409
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 13 with 30 rules applied. Total rules applied 1620 place count 239 transition count 379
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 14 with 32 rules applied. Total rules applied 1652 place count 209 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1654 place count 207 transition count 377
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 3 Pre rules applied. Total rules applied 1654 place count 207 transition count 374
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 1660 place count 204 transition count 374
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1668 place count 200 transition count 370
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 1671 place count 197 transition count 367
Iterating global reduction 16 with 3 rules applied. Total rules applied 1674 place count 197 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 1681 place count 197 transition count 360
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1684 place count 197 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1686 place count 197 transition count 358
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1687 place count 196 transition count 357
Applied a total of 1687 rules in 142 ms. Remains 196 /1626 variables (removed 1430) and now considering 357/2071 (removed 1714) transitions.
[2026-05-23 00:44:04] [INFO ] Flow matrix only has 308 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8319884212023403558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5294961341364901185.kers'
[2026-05-23 00:44:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8319884212023403558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5294961341364901185.kers]
Normalized transition count is 307 out of 308 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 196 cols 732 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-23 00:44:04] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5294961341364901185.kers
Total runtime 3 ms.
[2026-05-23 00:44:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 00:44:04] [INFO ] Flow matrix only has 308 transitions (discarded 49 similar events)
[2026-05-23 00:44:04] [INFO ] Invariant cache hit.
[2026-05-23 00:44:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 00:44:05] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [9, 72, 191]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 236 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 193/1626 places, 357/2071 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 191 transition count 355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 190 transition count 354
Applied a total of 3 rules in 16 ms. Remains 190 /193 variables (removed 3) and now considering 354/357 (removed 3) transitions.
[2026-05-23 00:44:05] [INFO ] Flow matrix only has 305 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-160692578153137262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2847117107102349901.kers'
[2026-05-23 00:44:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-160692578153137262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2847117107102349901.kers]
Normalized transition count is 304 out of 305 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 190 cols 717 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-23 00:44:05] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2847117107102349901.kers
Total runtime 1 ms.
[2026-05-23 00:44:05] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 00:44:05] [INFO ] Flow matrix only has 305 transitions (discarded 49 similar events)
[2026-05-23 00:44:05] [INFO ] Invariant cache hit.
[2026-05-23 00:44:05] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 190/1626 places, 354/2071 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 546 ms. Remains : 190/1626 places, 354/2071 transitions.
[2026-05-23 00:44:05] [INFO ] Flatten gal took : 4 ms
[2026-05-23 00:44:05] [INFO ] Flatten gal took : 26 ms
[2026-05-23 00:44:05] [INFO ] Input system was already deterministic with 354 transitions.
[2026-05-23 00:44:05] [INFO ] Flatten gal took : 4 ms
[2026-05-23 00:44:05] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:44:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7284563825814304158.gal : 1 ms
[2026-05-23 00:44:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1041281354542201734.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/CTLFireability7284563825814304158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1041281354542201734.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.00671e+06,0.221406,13328,2,1976,5,32960,6,0,1058,45508,0
Converting to forward existential form...Done !
original formula: AF(((EF((p1033==0)) * AG(((p2175==0)||(p1760==0)))) * (EG(AG((p1198==0))) * (AF((p2041==1)) + EG((p908==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U (p1033==0)) * !(E(TRUE U !(((p2175==0)||(p1760==0)))))) * (EG(!(E(TRUE U !((p1198==0))))...210
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t11, t12, t15, t31, t33, t58, t63, t66, t69, t70, t72, t87, t111, t120, t125, t126, t...476
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,22.3587,661612,1,0,874,3.66898e+06,706,528,6836,4.32222e+06,1135
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1579 transition count 2021
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1579 transition count 2021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 1579 transition count 2020
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 121 place count 1553 transition count 1993
Iterating global reduction 1 with 26 rules applied. Total rules applied 147 place count 1553 transition count 1993
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 153 place count 1553 transition count 1987
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 1542 transition count 1973
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 1542 transition count 1973
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 184 place count 1533 transition count 1961
Iterating global reduction 2 with 9 rules applied. Total rules applied 193 place count 1533 transition count 1961
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 1526 transition count 1953
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 1526 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 208 place count 1526 transition count 1952
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 213 place count 1521 transition count 1946
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 1521 transition count 1946
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 223 place count 1516 transition count 1941
Iterating global reduction 3 with 5 rules applied. Total rules applied 228 place count 1516 transition count 1941
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 232 place count 1512 transition count 1936
Iterating global reduction 3 with 4 rules applied. Total rules applied 236 place count 1512 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 239 place count 1509 transition count 1931
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 243 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 244 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 1507 transition count 1929
Applied a total of 246 rules in 705 ms. Remains 1507 /1626 variables (removed 119) and now considering 1929/2071 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7090433973913388084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12785042040038144299.kers'
[2026-05-23 00:44:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7090433973913388084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12785042040038144299.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1929 rows 1507 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 00:44:28] [INFO ] Computed 4 invariants in 11 ms
Computed 4 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12785042040038144299.kers
Total runtime 15 ms.
[2026-05-23 00:44:28] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-23 00:44:28] [INFO ] Invariant cache hit.
[2026-05-23 00:44:29] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 00:44:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 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 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60425ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60432ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1626 places, 1929/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62213 ms. Remains : 1507/1626 places, 1929/2071 transitions.
[2026-05-23 00:45:30] [INFO ] Flatten gal took : 19 ms
[2026-05-23 00:45:30] [INFO ] Flatten gal took : 21 ms
[2026-05-23 00:45:30] [INFO ] Input system was already deterministic with 1929 transitions.
[2026-05-23 00:45:30] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:45:30] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:45:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1179152163580091669.gal : 5 ms
[2026-05-23 00:45:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14591381119979495788.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/CTLFireability1179152163580091669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14591381119979495788.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.61335e+10,10.5613,272004,2,26796,5,713852,6,0,7959,1.36316e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:46:00] [INFO ] Flatten gal took : 19 ms
[2026-05-23 00:46:00] [INFO ] Applying decomposition
[2026-05-23 00:46:00] [INFO ] Flatten gal took : 26 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/graph2317901440191995529.txt' '-o' '/tmp/graph2317901440191995529.bin' '-w' '/tmp/graph2317901440191995529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2317901440191995529.bin' '-l' '-1' '-v' '-w' '/tmp/graph2317901440191995529.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:46:00] [INFO ] Decomposing Gal with order
[2026-05-23 00:46:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:46:00] [INFO ] Removed a total of 507 redundant transitions.
[2026-05-23 00:46:00] [INFO ] Flatten gal took : 56 ms
[2026-05-23 00:46:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 23 ms.
[2026-05-23 00:46:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10982050807083640803.gal : 14 ms
[2026-05-23 00:46:00] [INFO ] Time to serialize properties into /tmp/CTLFireability674705557610577933.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/CTLFireability10982050807083640803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability674705557610577933.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.61335e+10,1.01269,34168,2015,255,52216,4270,2480,88754,118,24944,0
Converting to forward existential form...Done !
original formula: AX(AF(AG((AG((i2.u28.p145==1)) * (i14.i2.i1.u219.p928==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !((!(E(TRUE U !((i2.u28.p145==1)))) * (i14.i2.i1.u219.p928==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t260, t320, t369, t440, t492, t645, t726, t757, t786, t906, t957, t1141, t1193, t1...2025
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
(forward)formula 0,0,5.20852,163968,1,0,289953,13585,25902,537075,572,60795,1304401
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 1578 transition count 2020
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1578 transition count 2020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 1578 transition count 2019
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 124 place count 1551 transition count 1991
Iterating global reduction 1 with 27 rules applied. Total rules applied 151 place count 1551 transition count 1991
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 157 place count 1551 transition count 1985
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 168 place count 1540 transition count 1971
Iterating global reduction 2 with 11 rules applied. Total rules applied 179 place count 1540 transition count 1971
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 188 place count 1531 transition count 1959
Iterating global reduction 2 with 9 rules applied. Total rules applied 197 place count 1531 transition count 1959
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 204 place count 1524 transition count 1951
Iterating global reduction 2 with 7 rules applied. Total rules applied 211 place count 1524 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 1524 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 217 place count 1519 transition count 1944
Iterating global reduction 3 with 5 rules applied. Total rules applied 222 place count 1519 transition count 1944
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 227 place count 1514 transition count 1939
Iterating global reduction 3 with 5 rules applied. Total rules applied 232 place count 1514 transition count 1939
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 1510 transition count 1934
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 1510 transition count 1934
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 243 place count 1507 transition count 1929
Iterating global reduction 3 with 3 rules applied. Total rules applied 246 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 247 place count 1506 transition count 1928
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 1506 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 1505 transition count 1927
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 1505 transition count 1927
Applied a total of 250 rules in 724 ms. Remains 1505 /1626 variables (removed 121) and now considering 1927/2071 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18209171324448431996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1237473467138509562.kers'
[2026-05-23 00:46:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18209171324448431996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1237473467138509562.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1927 rows 1505 cols 4023 entries
Finished phase 1 with 1500 SingleSign rule and 1 generalized
[2026-05-23 00:46:06] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-1237473467138509562.kers
Total runtime 12 ms.
[2026-05-23 00:46:06] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-23 00:46:06] [INFO ] Invariant cache hit.
[2026-05-23 00:46:07] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2026-05-23 00:46:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3432 variables, and 4 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3432 variables, and 4 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1626 places, 1927/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62347 ms. Remains : 1505/1626 places, 1927/2071 transitions.
[2026-05-23 00:47:08] [INFO ] Flatten gal took : 19 ms
[2026-05-23 00:47:08] [INFO ] Flatten gal took : 19 ms
[2026-05-23 00:47:08] [INFO ] Input system was already deterministic with 1927 transitions.
[2026-05-23 00:47:08] [INFO ] Flatten gal took : 19 ms
[2026-05-23 00:47:08] [INFO ] Flatten gal took : 19 ms
[2026-05-23 00:47:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5094481591487958563.gal : 5 ms
[2026-05-23 00:47:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6174916476825692388.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/CTLFireability5094481591487958563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6174916476825692388.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,1.60243e+10,12.9092,271432,2,26831,5,712101,6,0,7949,1.35822e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:47:38] [INFO ] Flatten gal took : 22 ms
[2026-05-23 00:47:38] [INFO ] Applying decomposition
[2026-05-23 00:47:38] [INFO ] Flatten gal took : 18 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/graph800147089606025719.txt' '-o' '/tmp/graph800147089606025719.bin' '-w' '/tmp/graph800147089606025719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph800147089606025719.bin' '-l' '-1' '-v' '-w' '/tmp/graph800147089606025719.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:47:38] [INFO ] Decomposing Gal with order
[2026-05-23 00:47:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:47:38] [INFO ] Removed a total of 514 redundant transitions.
[2026-05-23 00:47:38] [INFO ] Flatten gal took : 50 ms
[2026-05-23 00:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2026-05-23 00:47:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16511630278383645738.gal : 13 ms
[2026-05-23 00:47:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13206929127562674019.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/CTLFireability16511630278383645738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13206929127562674019.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,1.60243e+10,1.13828,37956,2218,257,52727,5819,2466,122056,131,40396,0
Converting to forward existential form...Done !
original formula: EF(AX(AG((i9.u156.p741==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((i9.u156.p741==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t208, t260, t291, t369, t440, t492, t645, t726, t786, t835, t906, t957, t1110, t11...2092
(forward)formula 0,1,4.89498,165504,1,0,287543,9637,21511,540701,594,42632,1490982
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Graph (trivial) has 1975 edges and 1626 vertex of which 714 / 1626 are part of one of the 63 SCC in 2 ms
Free SCC test removed 651 places
Ensure Unique test removed 757 transitions
Reduce isomorphic transitions removed 757 transitions.
Graph (complete) has 1492 edges and 975 vertex of which 966 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 542 transitions
Trivial Post-agglo rules discarded 542 transitions
Performed 542 trivial Post agglomeration. Transition count delta: 542
Iterating post reduction 0 with 542 rules applied. Total rules applied 544 place count 965 transition count 766
Reduce places removed 542 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 1 with 565 rules applied. Total rules applied 1109 place count 423 transition count 743
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 1120 place count 413 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1121 place count 412 transition count 742
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 1121 place count 412 transition count 699
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1207 place count 369 transition count 699
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1230 place count 346 transition count 666
Iterating global reduction 4 with 23 rules applied. Total rules applied 1253 place count 346 transition count 666
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1256 place count 346 transition count 663
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1257 place count 345 transition count 663
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1257 place count 345 transition count 662
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1259 place count 344 transition count 662
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1273 place count 330 transition count 645
Iterating global reduction 6 with 14 rules applied. Total rules applied 1287 place count 330 transition count 645
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 10 rules applied. Total rules applied 1297 place count 330 transition count 635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1299 place count 328 transition count 635
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1300 place count 327 transition count 633
Iterating global reduction 8 with 1 rules applied. Total rules applied 1301 place count 327 transition count 633
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1302 place count 326 transition count 631
Iterating global reduction 8 with 1 rules applied. Total rules applied 1303 place count 326 transition count 631
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1304 place count 325 transition count 629
Iterating global reduction 8 with 1 rules applied. Total rules applied 1305 place count 325 transition count 629
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1306 place count 324 transition count 627
Iterating global reduction 8 with 1 rules applied. Total rules applied 1307 place count 324 transition count 627
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 1389 place count 283 transition count 586
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 8 with 28 rules applied. Total rules applied 1417 place count 283 transition count 558
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 11 rules applied. Total rules applied 1428 place count 274 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1429 place count 273 transition count 556
Discarding 13 places :
Symmetric choice reduction at 11 with 13 rule applications. Total rules 1442 place count 260 transition count 532
Iterating global reduction 11 with 13 rules applied. Total rules applied 1455 place count 260 transition count 532
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1464 place count 251 transition count 514
Iterating global reduction 11 with 9 rules applied. Total rules applied 1473 place count 251 transition count 514
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1474 place count 250 transition count 512
Iterating global reduction 11 with 1 rules applied. Total rules applied 1475 place count 250 transition count 512
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1476 place count 249 transition count 510
Iterating global reduction 11 with 1 rules applied. Total rules applied 1477 place count 249 transition count 510
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1478 place count 248 transition count 508
Iterating global reduction 11 with 1 rules applied. Total rules applied 1479 place count 248 transition count 508
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1480 place count 247 transition count 506
Iterating global reduction 11 with 1 rules applied. Total rules applied 1481 place count 247 transition count 506
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1482 place count 246 transition count 504
Iterating global reduction 11 with 1 rules applied. Total rules applied 1483 place count 246 transition count 504
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1484 place count 245 transition count 499
Iterating global reduction 11 with 1 rules applied. Total rules applied 1485 place count 245 transition count 499
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1493 place count 241 transition count 495
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1499 place count 241 transition count 489
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1501 place count 239 transition count 489
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1505 place count 235 transition count 481
Iterating global reduction 13 with 4 rules applied. Total rules applied 1509 place count 235 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1510 place count 235 transition count 480
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1511 place count 234 transition count 478
Iterating global reduction 14 with 1 rules applied. Total rules applied 1512 place count 234 transition count 478
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1513 place count 233 transition count 474
Iterating global reduction 14 with 1 rules applied. Total rules applied 1514 place count 233 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 14 with 71 rules applied. Total rules applied 1585 place count 233 transition count 403
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 14 with 30 rules applied. Total rules applied 1615 place count 233 transition count 373
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 15 with 30 rules applied. Total rules applied 1645 place count 203 transition count 373
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 3 Pre rules applied. Total rules applied 1645 place count 203 transition count 370
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 1651 place count 200 transition count 370
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1659 place count 196 transition count 366
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 1662 place count 193 transition count 363
Iterating global reduction 16 with 3 rules applied. Total rules applied 1665 place count 193 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 1672 place count 193 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1673 place count 192 transition count 355
Applied a total of 1673 rules in 132 ms. Remains 192 /1626 variables (removed 1434) and now considering 355/2071 (removed 1716) transitions.
[2026-05-23 00:47:43] [INFO ] Flow matrix only has 305 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15490833615598802486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18440363055801857482.kers'
[2026-05-23 00:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15490833615598802486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18440363055801857482.kers]
Normalized transition count is 304 out of 305 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 192 cols 726 entries
Finished phase 1 with 192 SingleSign rule and 0 generalized
[2026-05-23 00:47:43] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18440363055801857482.kers
Total runtime 7 ms.
[2026-05-23 00:47:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-23 00:47:43] [INFO ] Flow matrix only has 305 transitions (discarded 50 similar events)
[2026-05-23 00:47:43] [INFO ] Invariant cache hit.
[2026-05-23 00:47:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 00:47:44] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [9, 69, 187]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 217 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 189/1626 places, 355/2071 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 187 transition count 353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 186 transition count 352
Applied a total of 3 rules in 12 ms. Remains 186 /189 variables (removed 3) and now considering 352/355 (removed 3) transitions.
[2026-05-23 00:47:44] [INFO ] Flow matrix only has 302 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5983825726598623921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9627298315966516197.kers'
[2026-05-23 00:47:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5983825726598623921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9627298315966516197.kers]
Normalized transition count is 301 out of 302 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 186 cols 711 entries
Finished phase 1 with 186 SingleSign rule and 0 generalized
[2026-05-23 00:47:44] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9627298315966516197.kers
Total runtime 1 ms.
[2026-05-23 00:47:44] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 00:47:44] [INFO ] Flow matrix only has 302 transitions (discarded 50 similar events)
[2026-05-23 00:47:44] [INFO ] Invariant cache hit.
[2026-05-23 00:47:44] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 186/1626 places, 352/2071 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 515 ms. Remains : 186/1626 places, 352/2071 transitions.
[2026-05-23 00:47:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:47:44] [INFO ] Flatten gal took : 4 ms
[2026-05-23 00:47:44] [INFO ] Input system was already deterministic with 352 transitions.
[2026-05-23 00:47:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:47:44] [INFO ] Flatten gal took : 4 ms
[2026-05-23 00:47:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14785072844345480957.gal : 1 ms
[2026-05-23 00:47:44] [INFO ] Time to serialize properties into /tmp/CTLFireability1135214713193693428.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/CTLFireability14785072844345480957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1135214713193693428.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,2.83175e+06,0.226867,12716,2,1947,5,31250,6,0,1039,43268,0
Converting to forward existential form...Done !
original formula: EG((EG(AF((p1050==1))) + (p1581==1)))
=> equivalent forward existential formula: [FwdG(Init,(EG(!(EG(!((p1050==1))))) + (p1581==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t11, t12, t14, t28, t30, t54, t60, t63, t68, t69, t72, t89, t113, t119, t122, t127, t...482
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.32139,155756,1,0,574,929712,687,310,6431,915863,793
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1580 transition count 2022
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1580 transition count 2022
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 1580 transition count 2021
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 119 place count 1554 transition count 1994
Iterating global reduction 1 with 26 rules applied. Total rules applied 145 place count 1554 transition count 1994
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 151 place count 1554 transition count 1988
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 161 place count 1544 transition count 1976
Iterating global reduction 2 with 10 rules applied. Total rules applied 171 place count 1544 transition count 1976
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 179 place count 1536 transition count 1966
Iterating global reduction 2 with 8 rules applied. Total rules applied 187 place count 1536 transition count 1966
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 193 place count 1530 transition count 1959
Iterating global reduction 2 with 6 rules applied. Total rules applied 199 place count 1530 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 1530 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 205 place count 1525 transition count 1952
Iterating global reduction 3 with 5 rules applied. Total rules applied 210 place count 1525 transition count 1952
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 215 place count 1520 transition count 1947
Iterating global reduction 3 with 5 rules applied. Total rules applied 220 place count 1520 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 224 place count 1516 transition count 1942
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 1516 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 231 place count 1513 transition count 1937
Iterating global reduction 3 with 3 rules applied. Total rules applied 234 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 235 place count 1512 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 237 place count 1511 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 1511 transition count 1935
Applied a total of 238 rules in 710 ms. Remains 1511 /1626 variables (removed 115) and now considering 1935/2071 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2981019299392239245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2839132348011855986.kers'
[2026-05-23 00:47:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2981019299392239245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2839132348011855986.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1935 rows 1511 cols 4039 entries
Finished phase 1 with 1506 SingleSign rule and 1 generalized
[2026-05-23 00:47:50] [INFO ] Computed 4 invariants in 15 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-2839132348011855986.kers
Total runtime 19 ms.
[2026-05-23 00:47:50] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-23 00:47:50] [INFO ] Invariant cache hit.
[2026-05-23 00:47:51] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2026-05-23 00:47:51] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1626 places, 1935/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62331 ms. Remains : 1511/1626 places, 1935/2071 transitions.
[2026-05-23 00:48:52] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:48:52] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:48:52] [INFO ] Input system was already deterministic with 1935 transitions.
[2026-05-23 00:48:52] [INFO ] Flatten gal took : 18 ms
[2026-05-23 00:48:52] [INFO ] Flatten gal took : 18 ms
[2026-05-23 00:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2722832717064036576.gal : 6 ms
[2026-05-23 00:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13019995538531255452.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/CTLFireability2722832717064036576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13019995538531255452.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.62336e+10,11.4217,261908,2,26865,5,677093,6,0,7981,1.36243e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:49:22] [INFO ] Flatten gal took : 21 ms
[2026-05-23 00:49:22] [INFO ] Applying decomposition
[2026-05-23 00:49:22] [INFO ] Flatten gal took : 20 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/graph3793123622106082129.txt' '-o' '/tmp/graph3793123622106082129.bin' '-w' '/tmp/graph3793123622106082129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3793123622106082129.bin' '-l' '-1' '-v' '-w' '/tmp/graph3793123622106082129.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:49:22] [INFO ] Decomposing Gal with order
[2026-05-23 00:49:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:49:22] [INFO ] Removed a total of 494 redundant transitions.
[2026-05-23 00:49:22] [INFO ] Flatten gal took : 44 ms
[2026-05-23 00:49:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 11 ms.
[2026-05-23 00:49:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10097199247504924407.gal : 13 ms
[2026-05-23 00:49:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14281654056685519179.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/CTLFireability10097199247504924407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14281654056685519179.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,1.62336e+10,0.98786,34512,1912,252,50911,6142,2505,93534,136,34796,0
Converting to forward existential form...Done !
original formula: (EG((i19.i0.i2.u310.p1352==0)) * EG(EX(!(E((i16.i2.i3.u250.p1080==1) U ((i16.i2.i3.u254.p1110==1)&&(i6.u87.p508==1)))))))
=> equivalent forward existential formula: [FwdG((Init * EG((i19.i0.i2.u310.p1352==0))),EX(!(E((i16.i2.i3.u250.p1080==1) U ((i16.i2.i3.u254.p1110==1)&&(i6....182
Reverse transition relation is NOT exact ! Due to transitions t26, t208, t260, t291, t320, t369, t440, t489, t492, t645, t674, t726, t757, t835, t906, t957...2096
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Graph (trivial) has 1975 edges and 1626 vertex of which 709 / 1626 are part of one of the 63 SCC in 2 ms
Free SCC test removed 646 places
Ensure Unique test removed 751 transitions
Reduce isomorphic transitions removed 751 transitions.
Graph (complete) has 1498 edges and 980 vertex of which 971 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 547 place count 970 transition count 769
Reduce places removed 545 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 570 rules applied. Total rules applied 1117 place count 425 transition count 744
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1129 place count 414 transition count 743
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1130 place count 413 transition count 743
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 1130 place count 413 transition count 701
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1214 place count 371 transition count 701
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1237 place count 348 transition count 668
Iterating global reduction 4 with 23 rules applied. Total rules applied 1260 place count 348 transition count 668
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1263 place count 348 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1264 place count 347 transition count 665
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1264 place count 347 transition count 664
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1266 place count 346 transition count 664
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1280 place count 332 transition count 647
Iterating global reduction 6 with 14 rules applied. Total rules applied 1294 place count 332 transition count 647
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 10 rules applied. Total rules applied 1304 place count 332 transition count 637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1306 place count 330 transition count 637
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1307 place count 329 transition count 635
Iterating global reduction 8 with 1 rules applied. Total rules applied 1308 place count 329 transition count 635
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1309 place count 328 transition count 633
Iterating global reduction 8 with 1 rules applied. Total rules applied 1310 place count 328 transition count 633
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1311 place count 327 transition count 631
Iterating global reduction 8 with 1 rules applied. Total rules applied 1312 place count 327 transition count 631
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1313 place count 326 transition count 629
Iterating global reduction 8 with 1 rules applied. Total rules applied 1314 place count 326 transition count 629
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 78 rules applied. Total rules applied 1392 place count 287 transition count 590
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 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 8 with 27 rules applied. Total rules applied 1419 place count 287 transition count 563
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 11 rules applied. Total rules applied 1430 place count 278 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1431 place count 277 transition count 561
Discarding 13 places :
Symmetric choice reduction at 11 with 13 rule applications. Total rules 1444 place count 264 transition count 537
Iterating global reduction 11 with 13 rules applied. Total rules applied 1457 place count 264 transition count 537
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1466 place count 255 transition count 519
Iterating global reduction 11 with 9 rules applied. Total rules applied 1475 place count 255 transition count 519
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1476 place count 254 transition count 517
Iterating global reduction 11 with 1 rules applied. Total rules applied 1477 place count 254 transition count 517
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1478 place count 253 transition count 515
Iterating global reduction 11 with 1 rules applied. Total rules applied 1479 place count 253 transition count 515
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1480 place count 252 transition count 513
Iterating global reduction 11 with 1 rules applied. Total rules applied 1481 place count 252 transition count 513
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1482 place count 251 transition count 511
Iterating global reduction 11 with 1 rules applied. Total rules applied 1483 place count 251 transition count 511
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1484 place count 250 transition count 509
Iterating global reduction 11 with 1 rules applied. Total rules applied 1485 place count 250 transition count 509
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1493 place count 246 transition count 505
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 7 rules applied. Total rules applied 1500 place count 246 transition count 498
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1502 place count 244 transition count 498
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1506 place count 240 transition count 490
Iterating global reduction 13 with 4 rules applied. Total rules applied 1510 place count 240 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1511 place count 240 transition count 489
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1512 place count 239 transition count 487
Iterating global reduction 14 with 1 rules applied. Total rules applied 1513 place count 239 transition count 487
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1514 place count 238 transition count 483
Iterating global reduction 14 with 1 rules applied. Total rules applied 1515 place count 238 transition count 483
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 14 with 74 rules applied. Total rules applied 1589 place count 238 transition count 409
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 32 rules applied. Total rules applied 1621 place count 238 transition count 377
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 15 with 32 rules applied. Total rules applied 1653 place count 206 transition count 377
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 3 Pre rules applied. Total rules applied 1653 place count 206 transition count 374
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 1659 place count 203 transition count 374
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1667 place count 199 transition count 370
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 1670 place count 196 transition count 367
Iterating global reduction 16 with 3 rules applied. Total rules applied 1673 place count 196 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 16 with 8 rules applied. Total rules applied 1681 place count 196 transition count 359
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1682 place count 195 transition count 358
Applied a total of 1682 rules in 101 ms. Remains 195 /1626 variables (removed 1431) and now considering 358/2071 (removed 1713) transitions.
[2026-05-23 00:49:52] [INFO ] Flow matrix only has 308 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15515862135880286647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10926110514740022369.kers'
[2026-05-23 00:49:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15515862135880286647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10926110514740022369.kers]
Normalized transition count is 307 out of 308 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 195 cols 733 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-23 00:49:52] [INFO ] Computed 0 invariants in 3 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10926110514740022369.kers
Total runtime 4 ms.
[2026-05-23 00:49:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 00:49:52] [INFO ] Flow matrix only has 308 transitions (discarded 50 similar events)
[2026-05-23 00:49:52] [INFO ] Invariant cache hit.
[2026-05-23 00:49:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 00:49:52] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2026-05-23 00:49:52] [INFO ] Redundant transitions in 28 ms returned []
Running 353 sub problems to find dead transitions.
[2026-05-23 00:49:52] [INFO ] Flow matrix only has 308 transitions (discarded 50 similar events)
[2026-05-23 00:49:52] [INFO ] Invariant cache hit.
[2026-05-23 00:49:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (OVERLAPS) 307/501 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 1/502 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 1/503 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/503 variables, and 196 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30013 ms.
Refiners :[State Equation: 195/195 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (OVERLAPS) 307/501 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 353/547 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 1/502 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (OVERLAPS) 1/503 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 549 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30011 ms.
Refiners :[State Equation: 195/195 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in SI_CTL mode, iteration 1 : 195/1626 places, 358/2071 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60420 ms. Remains : 195/1626 places, 358/2071 transitions.
[2026-05-23 00:50:52] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:50:52] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:50:52] [INFO ] Input system was already deterministic with 358 transitions.
[2026-05-23 00:50:52] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:50:52] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:50:53] [INFO ] Time to serialize gal into /tmp/CTLFireability11614373251806719326.gal : 2 ms
[2026-05-23 00:50:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7523385819008741817.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/CTLFireability11614373251806719326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7523385819008741817.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.26863e+06,0.285944,14412,2,2701,5,37955,6,0,1082,48909,0
Converting to forward existential form...Done !
original formula: EG((((p2001!=1) + AG((p1909!=1))) + AF(EG((p558==1)))))
=> equivalent forward existential formula: [FwdG(Init,(((p2001!=1) + !(E(TRUE U !((p1909!=1))))) + !(EG(!(EG((p558==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t7, t12, t13, t15, t29, t31, t58, t64, t67, t72, t73, t75, t90, t114, t120, t123, t12...516
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.79385,207460,1,0,600,1.15432e+06,703,337,7340,1.19853e+06,809
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 1578 transition count 2020
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1578 transition count 2020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 1578 transition count 2019
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 124 place count 1551 transition count 1991
Iterating global reduction 1 with 27 rules applied. Total rules applied 151 place count 1551 transition count 1991
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 157 place count 1551 transition count 1985
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 168 place count 1540 transition count 1971
Iterating global reduction 2 with 11 rules applied. Total rules applied 179 place count 1540 transition count 1971
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 188 place count 1531 transition count 1959
Iterating global reduction 2 with 9 rules applied. Total rules applied 197 place count 1531 transition count 1959
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 204 place count 1524 transition count 1951
Iterating global reduction 2 with 7 rules applied. Total rules applied 211 place count 1524 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 1524 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 217 place count 1519 transition count 1944
Iterating global reduction 3 with 5 rules applied. Total rules applied 222 place count 1519 transition count 1944
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 227 place count 1514 transition count 1939
Iterating global reduction 3 with 5 rules applied. Total rules applied 232 place count 1514 transition count 1939
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 1510 transition count 1934
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 1510 transition count 1934
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 243 place count 1507 transition count 1929
Iterating global reduction 3 with 3 rules applied. Total rules applied 246 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 247 place count 1506 transition count 1928
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 1506 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 1505 transition count 1927
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 1505 transition count 1927
Applied a total of 250 rules in 703 ms. Remains 1505 /1626 variables (removed 121) and now considering 1927/2071 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6179814869523733531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15074486704444409069.kers'
[2026-05-23 00:51:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6179814869523733531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15074486704444409069.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1927 rows 1505 cols 4023 entries
Finished phase 1 with 1500 SingleSign rule and 1 generalized
[2026-05-23 00:51:00] [INFO ] Computed 4 invariants in 20 ms
Computed 4 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-15074486704444409069.kers
Total runtime 24 ms.
[2026-05-23 00:51:00] [INFO ] Implicit Places using invariants in 330 ms returned []
[2026-05-23 00:51:00] [INFO ] Invariant cache hit.
[2026-05-23 00:51:01] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2026-05-23 00:51:01] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3432 variables, and 4 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3432 variables, and 4 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1626 places, 1927/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62407 ms. Remains : 1505/1626 places, 1927/2071 transitions.
[2026-05-23 00:52:02] [INFO ] Flatten gal took : 31 ms
[2026-05-23 00:52:02] [INFO ] Flatten gal took : 20 ms
[2026-05-23 00:52:02] [INFO ] Input system was already deterministic with 1927 transitions.
[2026-05-23 00:52:02] [INFO ] Flatten gal took : 18 ms
[2026-05-23 00:52:02] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability41189028141799440.gal : 5 ms
[2026-05-23 00:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11391922672780253840.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/CTLFireability41189028141799440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11391922672780253840.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 -...282
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.60243e+10,11.8105,271116,2,26831,5,712101,6,0,7949,1.35822e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:52:32] [INFO ] Flatten gal took : 19 ms
[2026-05-23 00:52:32] [INFO ] Applying decomposition
[2026-05-23 00:52:32] [INFO ] Flatten gal took : 16 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/graph6442581181017598548.txt' '-o' '/tmp/graph6442581181017598548.bin' '-w' '/tmp/graph6442581181017598548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6442581181017598548.bin' '-l' '-1' '-v' '-w' '/tmp/graph6442581181017598548.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:52:32] [INFO ] Decomposing Gal with order
[2026-05-23 00:52:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:52:32] [INFO ] Removed a total of 517 redundant transitions.
[2026-05-23 00:52:32] [INFO ] Flatten gal took : 40 ms
[2026-05-23 00:52:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 6 ms.
[2026-05-23 00:52:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3786402254146951758.gal : 24 ms
[2026-05-23 00:52:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1784477914451262023.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/CTLFireability3786402254146951758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1784477914451262023.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.60243e+10,1.51254,49628,2786,248,82030,5536,2091,164876,116,33640,0
Converting to forward existential form...Done !
original formula: EF(EX((EX(!(E((i29.u418.p1714==1) U ((i7.u41.p572==1)&&(i7.u117.p590==1))))) * (i24.u350.p1463==1))))
=> equivalent forward existential formula: [(EY((EY(FwdU(Init,TRUE)) * (i24.u350.p1463==1))) * !(E((i29.u418.p1714==1) U ((i7.u41.p572==1)&&(i7.u117.p590==...171
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t208, t260, t274, t279, t345, t369, t440, t492, t645, t726, t757, t835, t906, t957...1607
(forward)formula 0,1,5.5797,191768,1,0,345679,6245,18190,834229,523,33640,1299022
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1585 transition count 2028
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1585 transition count 2028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 83 place count 1585 transition count 2027
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 105 place count 1563 transition count 2004
Iterating global reduction 1 with 22 rules applied. Total rules applied 127 place count 1563 transition count 2004
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 131 place count 1563 transition count 2000
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 141 place count 1553 transition count 1988
Iterating global reduction 2 with 10 rules applied. Total rules applied 151 place count 1553 transition count 1988
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 160 place count 1544 transition count 1976
Iterating global reduction 2 with 9 rules applied. Total rules applied 169 place count 1544 transition count 1976
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 1537 transition count 1968
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 1537 transition count 1968
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 184 place count 1537 transition count 1967
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 189 place count 1532 transition count 1961
Iterating global reduction 3 with 5 rules applied. Total rules applied 194 place count 1532 transition count 1961
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 199 place count 1527 transition count 1956
Iterating global reduction 3 with 5 rules applied. Total rules applied 204 place count 1527 transition count 1956
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 208 place count 1523 transition count 1951
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 1523 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 215 place count 1520 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 218 place count 1520 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 219 place count 1519 transition count 1945
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 1519 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 221 place count 1518 transition count 1944
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 1518 transition count 1944
Applied a total of 222 rules in 706 ms. Remains 1518 /1626 variables (removed 108) and now considering 1944/2071 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8942936700020238220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1375874361898093097.kers'
[2026-05-23 00:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8942936700020238220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1375874361898093097.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1944 rows 1518 cols 4059 entries
Finished phase 1 with 1513 SingleSign rule and 1 generalized
[2026-05-23 00:52:39] [INFO ] Computed 4 invariants in 10 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-1375874361898093097.kers
Total runtime 15 ms.
[2026-05-23 00:52:39] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-23 00:52:39] [INFO ] Invariant cache hit.
[2026-05-23 00:52:40] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Running 1943 sub problems to find dead transitions.
[2026-05-23 00:52:40] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1517 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1517/3462 variables, and 4 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1518 constraints, PredecessorRefiner: 1943/1943 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1943 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1517 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1517/3462 variables, and 4 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1518 constraints, PredecessorRefiner: 0/1943 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60454ms problems are : Problem set: 0 solved, 1943 unsolved
Search for dead transitions found 0 dead transitions in 60457ms
Starting structural reductions in LTL mode, iteration 1 : 1518/1626 places, 1944/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62293 ms. Remains : 1518/1626 places, 1944/2071 transitions.
[2026-05-23 00:53:40] [INFO ] Flatten gal took : 18 ms
[2026-05-23 00:53:40] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:53:40] [INFO ] Input system was already deterministic with 1944 transitions.
[2026-05-23 00:53:40] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:53:40] [INFO ] Flatten gal took : 18 ms
[2026-05-23 00:53:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14429626566627143666.gal : 5 ms
[2026-05-23 00:53:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17614071891831821249.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/CTLFireability14429626566627143666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17614071891831821249.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,1.67009e+10,11.8479,274624,2,26956,5,715835,6,0,8018,1.38168e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:54:10] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:54:10] [INFO ] Applying decomposition
[2026-05-23 00:54:10] [INFO ] Flatten gal took : 18 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/graph12792118518924651522.txt' '-o' '/tmp/graph12792118518924651522.bin' '-w' '/tmp/graph12792118518924651522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12792118518924651522.bin' '-l' '-1' '-v' '-w' '/tmp/graph12792118518924651522.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:54:11] [INFO ] Decomposing Gal with order
[2026-05-23 00:54:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:54:11] [INFO ] Removed a total of 534 redundant transitions.
[2026-05-23 00:54:11] [INFO ] Flatten gal took : 40 ms
[2026-05-23 00:54:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 34 ms.
[2026-05-23 00:54:11] [INFO ] Time to serialize gal into /tmp/CTLFireability13785902906690493580.gal : 26 ms
[2026-05-23 00:54:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3326540413969137009.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/CTLFireability13785902906690493580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3326540413969137009.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,1.67009e+10,1.53452,48864,1960,232,80976,3364,2532,153745,116,19488,0
Converting to forward existential form...Done !
original formula: A(E((E(AG(((i28.i0.i1.u120.p1245==1)&&(i28.i2.i2.u641.p2575==1))) U ((i6.u94.p481==1)||(i31.u515.p2075==1))) + ((i15.i0.i1.u218.p906==1) ...543
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(EG(!(E((i28.i1.i2.u312.p1296==1) U (i37.u623.p2465==1))))) + (((i27.u469.p1927==1)&...982
Reverse transition relation is NOT exact ! Due to transitions t26, t208, t260, t291, t320, t370, t441, t493, t646, t727, t758, t909, t960, t1143, t1209, t1...2170
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1582 transition count 2024
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1582 transition count 2024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 1582 transition count 2023
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 114 place count 1557 transition count 1998
Iterating global reduction 1 with 25 rules applied. Total rules applied 139 place count 1557 transition count 1998
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 144 place count 1557 transition count 1993
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 155 place count 1546 transition count 1979
Iterating global reduction 2 with 11 rules applied. Total rules applied 166 place count 1546 transition count 1979
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 175 place count 1537 transition count 1967
Iterating global reduction 2 with 9 rules applied. Total rules applied 184 place count 1537 transition count 1967
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 1530 transition count 1959
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 1530 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 1530 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 204 place count 1525 transition count 1952
Iterating global reduction 3 with 5 rules applied. Total rules applied 209 place count 1525 transition count 1952
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 214 place count 1520 transition count 1947
Iterating global reduction 3 with 5 rules applied. Total rules applied 219 place count 1520 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 223 place count 1516 transition count 1942
Iterating global reduction 3 with 4 rules applied. Total rules applied 227 place count 1516 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 230 place count 1513 transition count 1937
Iterating global reduction 3 with 3 rules applied. Total rules applied 233 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 234 place count 1512 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 236 place count 1511 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 1511 transition count 1935
Applied a total of 237 rules in 724 ms. Remains 1511 /1626 variables (removed 115) and now considering 1935/2071 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13198742582221212119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16559629842782580007.kers'
[2026-05-23 00:54:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13198742582221212119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16559629842782580007.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1935 rows 1511 cols 4039 entries
Finished phase 1 with 1506 SingleSign rule and 1 generalized
[2026-05-23 00:54:42] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16559629842782580007.kers
Total runtime 10 ms.
[2026-05-23 00:54:42] [INFO ] Implicit Places using invariants in 396 ms returned []
[2026-05-23 00:54:42] [INFO ] Invariant cache hit.
[2026-05-23 00:54:43] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2026-05-23 00:54:43] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1626 places, 1935/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62461 ms. Remains : 1511/1626 places, 1935/2071 transitions.
[2026-05-23 00:55:43] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:55:43] [INFO ] Flatten gal took : 24 ms
[2026-05-23 00:55:43] [INFO ] Input system was already deterministic with 1935 transitions.
[2026-05-23 00:55:43] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:55:43] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:55:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11392738179442410024.gal : 5 ms
[2026-05-23 00:55:43] [INFO ] Time to serialize properties into /tmp/CTLFireability296442315113987576.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/CTLFireability11392738179442410024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability296442315113987576.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,1.63021e+10,11.4647,279048,2,27936,5,783976,6,0,7981,1.36396e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:56:13] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:56:13] [INFO ] Applying decomposition
[2026-05-23 00:56:13] [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/graph17545832638513900556.txt' '-o' '/tmp/graph17545832638513900556.bin' '-w' '/tmp/graph17545832638513900556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17545832638513900556.bin' '-l' '-1' '-v' '-w' '/tmp/graph17545832638513900556.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:56:14] [INFO ] Decomposing Gal with order
[2026-05-23 00:56:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:56:14] [INFO ] Removed a total of 521 redundant transitions.
[2026-05-23 00:56:14] [INFO ] Flatten gal took : 36 ms
[2026-05-23 00:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 14 ms.
[2026-05-23 00:56:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16642724327604822505.gal : 12 ms
[2026-05-23 00:56:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1579628973015066979.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/CTLFireability16642724327604822505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1579628973015066979.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,1.63021e+10,1.01017,35856,1912,204,52835,4521,2522,102517,121,29910,0
Converting to forward existential form...Done !
original formula: AX(EG(((EF((i10.u158.p721==0)) * ((!(E((i38.i1.i3.u301.p1299==1) U (i29.i0.i0.u478.p1994==1))) + (i24.u366.p1522==0)) + (i1.u29.p137==0))...357
=> equivalent forward existential formula: [(EY(Init) * !(EG(((E(TRUE U (i10.u158.p721==0)) * ((!(E((i38.i1.i3.u301.p1299==1) U (i29.i0.i0.u478.p1994==1)))...410
Reverse transition relation is NOT exact ! Due to transitions t26, t209, t261, t292, t321, t370, t441, t493, t646, t727, t787, t836, t907, t958, t1111, t11...2189
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Graph (trivial) has 1967 edges and 1626 vertex of which 695 / 1626 are part of one of the 62 SCC in 1 ms
Free SCC test removed 633 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1514 edges and 993 vertex of which 984 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 546 place count 983 transition count 786
Reduce places removed 544 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 571 rules applied. Total rules applied 1117 place count 439 transition count 759
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 1131 place count 427 transition count 757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1133 place count 425 transition count 757
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1133 place count 425 transition count 712
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1223 place count 380 transition count 712
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1246 place count 357 transition count 679
Iterating global reduction 4 with 23 rules applied. Total rules applied 1269 place count 357 transition count 679
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1272 place count 357 transition count 676
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1273 place count 356 transition count 676
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1273 place count 356 transition count 675
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1275 place count 355 transition count 675
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1289 place count 341 transition count 658
Iterating global reduction 6 with 14 rules applied. Total rules applied 1303 place count 341 transition count 658
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 10 rules applied. Total rules applied 1313 place count 341 transition count 648
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1315 place count 339 transition count 648
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1316 place count 338 transition count 646
Iterating global reduction 8 with 1 rules applied. Total rules applied 1317 place count 338 transition count 646
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1318 place count 337 transition count 644
Iterating global reduction 8 with 1 rules applied. Total rules applied 1319 place count 337 transition count 644
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1320 place count 336 transition count 642
Iterating global reduction 8 with 1 rules applied. Total rules applied 1321 place count 336 transition count 642
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1322 place count 335 transition count 640
Iterating global reduction 8 with 1 rules applied. Total rules applied 1323 place count 335 transition count 640
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 84 rules applied. Total rules applied 1407 place count 293 transition count 598
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 8 with 28 rules applied. Total rules applied 1435 place count 293 transition count 570
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 11 rules applied. Total rules applied 1446 place count 284 transition count 568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1447 place count 283 transition count 568
Discarding 13 places :
Symmetric choice reduction at 11 with 13 rule applications. Total rules 1460 place count 270 transition count 544
Iterating global reduction 11 with 13 rules applied. Total rules applied 1473 place count 270 transition count 544
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1482 place count 261 transition count 526
Iterating global reduction 11 with 9 rules applied. Total rules applied 1491 place count 261 transition count 526
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1492 place count 260 transition count 524
Iterating global reduction 11 with 1 rules applied. Total rules applied 1493 place count 260 transition count 524
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1494 place count 259 transition count 522
Iterating global reduction 11 with 1 rules applied. Total rules applied 1495 place count 259 transition count 522
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1496 place count 258 transition count 520
Iterating global reduction 11 with 1 rules applied. Total rules applied 1497 place count 258 transition count 520
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1498 place count 257 transition count 518
Iterating global reduction 11 with 1 rules applied. Total rules applied 1499 place count 257 transition count 518
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1500 place count 256 transition count 516
Iterating global reduction 11 with 1 rules applied. Total rules applied 1501 place count 256 transition count 516
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1502 place count 255 transition count 511
Iterating global reduction 11 with 1 rules applied. Total rules applied 1503 place count 255 transition count 511
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1511 place count 251 transition count 507
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1517 place count 251 transition count 501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1519 place count 249 transition count 501
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1523 place count 245 transition count 493
Iterating global reduction 13 with 4 rules applied. Total rules applied 1527 place count 245 transition count 493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1528 place count 245 transition count 492
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1529 place count 244 transition count 490
Iterating global reduction 14 with 1 rules applied. Total rules applied 1530 place count 244 transition count 490
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1531 place count 243 transition count 486
Iterating global reduction 14 with 1 rules applied. Total rules applied 1532 place count 243 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 14 with 72 rules applied. Total rules applied 1604 place count 243 transition count 414
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 14 with 31 rules applied. Total rules applied 1635 place count 243 transition count 383
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 15 with 31 rules applied. Total rules applied 1666 place count 212 transition count 383
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 3 Pre rules applied. Total rules applied 1666 place count 212 transition count 380
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 1672 place count 209 transition count 380
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1680 place count 205 transition count 376
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 1683 place count 202 transition count 373
Iterating global reduction 16 with 3 rules applied. Total rules applied 1686 place count 202 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 1693 place count 202 transition count 366
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1694 place count 202 transition count 366
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1695 place count 201 transition count 365
Applied a total of 1695 rules in 106 ms. Remains 201 /1626 variables (removed 1425) and now considering 365/2071 (removed 1706) transitions.
[2026-05-23 00:56:44] [INFO ] Flow matrix only has 316 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5220889299385478577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14958121544427024884.kers'
[2026-05-23 00:56:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5220889299385478577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14958121544427024884.kers]
Normalized transition count is 315 out of 316 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 201 cols 750 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-23 00:56:44] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14958121544427024884.kers
Total runtime 2 ms.
[2026-05-23 00:56:44] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 00:56:44] [INFO ] Flow matrix only has 316 transitions (discarded 49 similar events)
[2026-05-23 00:56:44] [INFO ] Invariant cache hit.
[2026-05-23 00:56:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 00:56:44] [INFO ] Implicit Places using invariants and state equation in 160 ms returned [9, 70, 196]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 223 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 198/1626 places, 365/2071 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 196 transition count 363
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 362
Applied a total of 3 rules in 12 ms. Remains 195 /198 variables (removed 3) and now considering 362/365 (removed 3) transitions.
[2026-05-23 00:56:44] [INFO ] Flow matrix only has 313 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5486541712551354876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5330787665453121988.kers'
[2026-05-23 00:56:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5486541712551354876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5330787665453121988.kers]
Normalized transition count is 312 out of 313 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 195 cols 735 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-23 00:56:44] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5330787665453121988.kers
Total runtime 3 ms.
[2026-05-23 00:56:44] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 00:56:44] [INFO ] Flow matrix only has 313 transitions (discarded 49 similar events)
[2026-05-23 00:56:44] [INFO ] Invariant cache hit.
[2026-05-23 00:56:44] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 195/1626 places, 362/2071 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 500 ms. Remains : 195/1626 places, 362/2071 transitions.
[2026-05-23 00:56:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:56:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:56:44] [INFO ] Input system was already deterministic with 362 transitions.
[2026-05-23 00:56:44] [INFO ] Flatten gal took : 4 ms
[2026-05-23 00:56:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 00:56:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15619943465210796258.gal : 1 ms
[2026-05-23 00:56:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15002825792964152705.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/CTLFireability15619943465210796258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15002825792964152705.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.33156e+06,0.270759,13628,2,2032,5,35045,6,0,1086,47515,0
Converting to forward existential form...Done !
original formula: (EF((E(E((p1312==1) U (p1304!=1)) U (p812!=1)) * (p1404==1))) + E((p2284==1) U (p2152==1)))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (p1404==1)),E((p1312==1) U (p1304!=1))) * (p812!=1))] != FALSE + [(FwdU(Init,(p2284==...183
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t11, t12, t16, t30, t35, t59, t65, t68, t73, t74, t76, t91, t118, t125, t128, t133, t...482
(forward)formula 0,1,2.94484,88824,1,0,505,391615,700,294,6409,493759,751
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 1584 transition count 2026
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 1584 transition count 2026
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 1584 transition count 2025
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 109 place count 1560 transition count 2000
Iterating global reduction 1 with 24 rules applied. Total rules applied 133 place count 1560 transition count 2000
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 1560 transition count 1994
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 147 place count 1552 transition count 1983
Iterating global reduction 2 with 8 rules applied. Total rules applied 155 place count 1552 transition count 1983
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 161 place count 1546 transition count 1974
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 1546 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 172 place count 1541 transition count 1968
Iterating global reduction 2 with 5 rules applied. Total rules applied 177 place count 1541 transition count 1968
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 1541 transition count 1967
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 181 place count 1538 transition count 1963
Iterating global reduction 3 with 3 rules applied. Total rules applied 184 place count 1538 transition count 1963
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 1535 transition count 1960
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 1535 transition count 1960
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 1533 transition count 1957
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 1533 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 195 place count 1532 transition count 1955
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 1532 transition count 1955
Applied a total of 196 rules in 599 ms. Remains 1532 /1626 variables (removed 94) and now considering 1955/2071 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13651154843300685861.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12072643215747541122.kers'
[2026-05-23 00:56:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13651154843300685861.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12072643215747541122.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1955 rows 1532 cols 4083 entries
Finished phase 1 with 1527 SingleSign rule and 1 generalized
[2026-05-23 00:56:48] [INFO ] Computed 4 invariants in 15 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-12072643215747541122.kers
Total runtime 19 ms.
[2026-05-23 00:56:48] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-23 00:56:48] [INFO ] Invariant cache hit.
[2026-05-23 00:56:49] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Running 1954 sub problems to find dead transitions.
[2026-05-23 00:56:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1531 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1531/3487 variables, and 4 constraints, problems are : Problem set: 0 solved, 1954 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1532 constraints, PredecessorRefiner: 1954/1954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1531 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1954 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1531/3487 variables, and 4 constraints, problems are : Problem set: 0 solved, 1954 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1532 constraints, PredecessorRefiner: 0/1954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 1954 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Starting structural reductions in LTL mode, iteration 1 : 1532/1626 places, 1955/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62167 ms. Remains : 1532/1626 places, 1955/2071 transitions.
[2026-05-23 00:57:50] [INFO ] Flatten gal took : 16 ms
[2026-05-23 00:57:50] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:57:50] [INFO ] Input system was already deterministic with 1955 transitions.
[2026-05-23 00:57:50] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:57:50] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:57:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5830185554781322629.gal : 5 ms
[2026-05-23 00:57:50] [INFO ] Time to serialize properties into /tmp/CTLFireability11917288147094779791.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/CTLFireability5830185554781322629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11917288147094779791.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.7081e+10,12.4148,273516,2,27284,5,733252,6,0,8085,1.38145e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:58:20] [INFO ] Flatten gal took : 18 ms
[2026-05-23 00:58:20] [INFO ] Applying decomposition
[2026-05-23 00:58:20] [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/graph2489822882415708840.txt' '-o' '/tmp/graph2489822882415708840.bin' '-w' '/tmp/graph2489822882415708840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2489822882415708840.bin' '-l' '-1' '-v' '-w' '/tmp/graph2489822882415708840.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:58:20] [INFO ] Decomposing Gal with order
[2026-05-23 00:58:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:58:20] [INFO ] Removed a total of 505 redundant transitions.
[2026-05-23 00:58:20] [INFO ] Flatten gal took : 36 ms
[2026-05-23 00:58:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 8 ms.
[2026-05-23 00:58:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4033157696058187244.gal : 11 ms
[2026-05-23 00:58:20] [INFO ] Time to serialize properties into /tmp/CTLFireability10739879584525382557.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/CTLFireability4033157696058187244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10739879584525382557.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,1.7081e+10,1.95183,61648,2153,257,97300,15673,2534,200625,122,108633,0
Converting to forward existential form...Done !
original formula: (EG((i36.i2.i0.u420.p1863==0)) + EG((((AF(((i36.i2.i0.u420.p1818==0)||(i0.u14.p92==0))) + AX((i14.u195.p893==0))) + ((i15.i0.i0.u208.p934...201
=> equivalent forward existential formula: ([FwdG(Init,(i36.i2.i0.u420.p1863==0))] != FALSE + [FwdG(Init,(((!(EG(!(((i36.i2.i0.u420.p1818==0)||(i0.u14.p92=...274
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
(forward)formula 0,1,5.01417,137416,1,0,217725,15673,10938,752612,481,108633,419197
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2071/2071 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1579 transition count 2021
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1579 transition count 2021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 1579 transition count 2020
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 121 place count 1553 transition count 1993
Iterating global reduction 1 with 26 rules applied. Total rules applied 147 place count 1553 transition count 1993
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 153 place count 1553 transition count 1987
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 1542 transition count 1973
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 1542 transition count 1973
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 184 place count 1533 transition count 1961
Iterating global reduction 2 with 9 rules applied. Total rules applied 193 place count 1533 transition count 1961
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 1526 transition count 1953
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 1526 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 208 place count 1526 transition count 1952
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 213 place count 1521 transition count 1946
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 1521 transition count 1946
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 223 place count 1516 transition count 1941
Iterating global reduction 3 with 5 rules applied. Total rules applied 228 place count 1516 transition count 1941
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 232 place count 1512 transition count 1936
Iterating global reduction 3 with 4 rules applied. Total rules applied 236 place count 1512 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 239 place count 1509 transition count 1931
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 243 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 244 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 1507 transition count 1929
Applied a total of 246 rules in 701 ms. Remains 1507 /1626 variables (removed 119) and now considering 1929/2071 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14479077507218454905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3834970979254671668.kers'
[2026-05-23 00:58:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14479077507218454905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3834970979254671668.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1929 rows 1507 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 00:58:26] [INFO ] Computed 4 invariants in 15 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-3834970979254671668.kers
Total runtime 20 ms.
[2026-05-23 00:58:26] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-23 00:58:26] [INFO ] Invariant cache hit.
[2026-05-23 00:58:27] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 00:58:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1626 places, 1929/2071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62264 ms. Remains : 1507/1626 places, 1929/2071 transitions.
[2026-05-23 00:59:27] [INFO ] Flatten gal took : 18 ms
[2026-05-23 00:59:27] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:59:27] [INFO ] Input system was already deterministic with 1929 transitions.
[2026-05-23 00:59:27] [INFO ] Flatten gal took : 17 ms
[2026-05-23 00:59:27] [INFO ] Flatten gal took : 31 ms
[2026-05-23 00:59:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16643261506543064916.gal : 5 ms
[2026-05-23 00:59:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10732786428460586864.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/CTLFireability16643261506543064916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10732786428460586864.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,1.61335e+10,12.4268,275288,2,27683,5,762499,6,0,7959,1.35736e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 00:59:57] [INFO ] Flatten gal took : 18 ms
[2026-05-23 00:59:57] [INFO ] Applying decomposition
[2026-05-23 00:59:58] [INFO ] Flatten gal took : 23 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/graph5421203809225356884.txt' '-o' '/tmp/graph5421203809225356884.bin' '-w' '/tmp/graph5421203809225356884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5421203809225356884.bin' '-l' '-1' '-v' '-w' '/tmp/graph5421203809225356884.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:59:58] [INFO ] Decomposing Gal with order
[2026-05-23 00:59:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:59:58] [INFO ] Removed a total of 517 redundant transitions.
[2026-05-23 00:59:58] [INFO ] Flatten gal took : 35 ms
[2026-05-23 00:59:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 9 ms.
[2026-05-23 00:59:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13854754417418688276.gal : 10 ms
[2026-05-23 00:59:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1551908640427719531.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/CTLFireability13854754417418688276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1551908640427719531.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,1.61335e+10,1.30592,45188,2316,214,68797,5280,2585,144086,115,45447,0
Converting to forward existential form...Done !
original formula: EG(EF(((EG(AG((i18.i0.i2.u243.p1053==1))) + AX((i12.u156.p751==0))) + ((i31.u494.p2051==0)||(i26.i1.i0.u393.p1612==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((EG(!(E(TRUE U !((i18.i0.i2.u243.p1053==1))))) + !(EX(!((i12.u156.p751==0))))) + ((i31.u494...206
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t208, t260, t320, t369, t440, t492, t645, t726, t757, t835, t906, t957, t1110, t11...2031
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
(forward)formula 0,1,7.46645,241112,1,0,419624,13403,26573,788402,533,80558,2155253
FORMULA CloudReconfiguration-PT-301-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
[2026-05-23 01:00:05] [INFO ] Flatten gal took : 20 ms
[2026-05-23 01:00:05] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:00:05] [INFO ] Applying decomposition
[2026-05-23 01:00:05] [INFO ] Flatten gal took : 18 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/graph10845144663941648769.txt' '-o' '/tmp/graph10845144663941648769.bin' '-w' '/tmp/graph10845144663941648769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10845144663941648769.bin' '-l' '-1' '-v' '-w' '/tmp/graph10845144663941648769.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:00:05] [INFO ] Decomposing Gal with order
[2026-05-23 01:00:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:00:06] [INFO ] Removed a total of 546 redundant transitions.
[2026-05-23 01:00:06] [INFO ] Flatten gal took : 54 ms
[2026-05-23 01:00:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 5 ms.
[2026-05-23 01:00:06] [INFO ] Time to serialize gal into /tmp/CTLFireability296696244831546609.gal : 8 ms
[2026-05-23 01:00:06] [INFO ] Time to serialize properties into /tmp/CTLFireability729329701295078127.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/CTLFireability296696244831546609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability729329701295078127.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 -...260
No direction supplied, using forward translation only.
Parsed 4 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,2.12644e+10,1.68231,59644,2868,222,101018,4365,2275,208848,124,30326,0
Converting to forward existential form...Done !
original formula: A(E((i36.u678.p2549==1) U ((AX(((i17.u501.p1291==1)||(i21.u386.p1464==1))) * AX(((i7.u114.p512==1)||(i13.u235.p904==1)))) * AG(AX((i21.u3...407
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((EG((((i29.u545.p2028==1)||(i2.u60.p270==1))||(i7.u112.p503==1))) * (!(E(TRUE U !(((i28....1032
Reverse transition relation is NOT exact ! Due to transitions t26, t217, t271, t292, t306, t459, t509, t512, t697, t726, t778, t809, t840, t962, t1014, t11...1801
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-23 01:01:39] [INFO ] Applying decomposition
[2026-05-23 01:01:39] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:01:39] [INFO ] Decomposing Gal with order
[2026-05-23 01:01:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:01:39] [INFO ] Removed a total of 76 redundant transitions.
[2026-05-23 01:01:39] [INFO ] Flatten gal took : 27 ms
[2026-05-23 01:01:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 2 ms.
[2026-05-23 01:01:39] [INFO ] Time to serialize gal into /tmp/CTLFireability10517752345459181291.gal : 10 ms
[2026-05-23 01:01:39] [INFO ] Time to serialize properties into /tmp/CTLFireability9412915534039419796.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/CTLFireability10517752345459181291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9412915534039419796.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 4 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,2.12644e+10,4.13999,94248,181,10590,4095,210077,164,8312,3690,814682,0
Converting to forward existential form...Done !
original formula: A(E((i0.i1.u7.p2549==1) U ((AX(((i0.i1.i0.u6.p1291==1)||(i0.i1.i0.u6.p1464==1))) * AX(((i0.u2.p512==1)||(i0.i1.i0.u5.p904==1)))) * AG(AX(...405
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((EG((((i0.i1.u7.p2028==1)||(i0.u2.p270==1))||(i0.u2.p503==1))) * (!(E(TRUE U !(((u9.p8==...1006
Reverse transition relation is NOT exact ! Due to transitions t1919, t1923, t1924, t1925, i0.u2.t1530, i0.u2.t1548, i0.u2.t1570, i0.u2.t1616, i0.u2.t1629, ...2798
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Detected timeout of ITS tools.
[2026-05-23 01:28:58] [INFO ] Flatten gal took : 176 ms
[2026-05-23 01:28:59] [INFO ] Input system was already deterministic with 2071 transitions.
[2026-05-23 01:29:00] [INFO ] Transformed 1626 places.
[2026-05-23 01:29:00] [INFO ] Transformed 2071 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-23 01:29:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3848221235272228830.gal : 16 ms
[2026-05-23 01:29:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12868356667349802181.ctl : 8 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/CTLFireability3848221235272228830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12868356667349802181.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 4 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,2.12644e+10,117.307,2001440,2,55805,5,6.91162e+06,6,0,8577,3.9057e+06,0
Converting to forward existential form...Done !
original formula: A(E((p2549==1) U ((AX(((p1291==1)||(p1464==1))) * AX(((p512==1)||(p904==1)))) * AG(AX((p1481==1))))) U AF((EG((((p2028==1)||(p270==1))||(...264
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((EG((((p2028==1)||(p270==1))||(p503==1))) * (!(E(TRUE U !(((p8==1)||(p335==1))))) + ((p3...709
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t50, t57, t82, t89, t90, t93, t100, t101, t138, t139, t140, t151, t152, t162, t163,...1226
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="CloudReconfiguration-PT-301"
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 CloudReconfiguration-PT-301, 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 r066-tall-177946967500114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-301.tgz
mv CloudReconfiguration-PT-301 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 ;