About the Execution of ITS-Tools for CANInsertWithFailure-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7896.468 | 3600000.00 | 5232292.00 | 28605.70 | [undef] | Time out reached |
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.r034-tall-177946842200741.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 CANInsertWithFailure-PT-050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842200741
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Mar 6 10:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 10:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 6 10:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 6 10:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Mar 15 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 6 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 6 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 6 10:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 6 10:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:54 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 16M 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 positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779679811037
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 03:30:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 03:30:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 03:30:12] [INFO ] Load time of PNML (sax parser for PT used): 475 ms
[2026-05-25 03:30:12] [INFO ] Transformed 5604 places.
[2026-05-25 03:30:12] [INFO ] Transformed 15300 transitions.
[2026-05-25 03:30:12] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 612 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8984991934183078962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14500706905275132870.kers'
[2026-05-25 03:30:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8984991934183078962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14500706905275132870.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 6 ms.
// Phase 1: matrix 15300 rows 5603 cols 31000 entries
Finished phase 1 with 5501 SingleSign rule and 50 generalized
[2026-05-25 03:30:13] [INFO ] Computed 53 invariants in 349 ms
Computed 53 P flows in 350 ms.
Exported basis to /tmp/petrispot-output-14500706905275132870.kers
Total runtime 361 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 10000 steps (8 resets) in 179 ms. (55 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 222 ms. (717 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2026-05-25 03:30:13] [INFO ] Invariant cache hit.
[2026-05-25 03:30:14] [INFO ] [Real]Absence check using 51 positive place invariants in 108 ms returned sat
[2026-05-25 03:30:14] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:30:18] [INFO ] [Real]Absence check using state equation in 4194 ms returned unknown
[2026-05-25 03:30:19] [INFO ] [Real]Absence check using 51 positive place invariants in 95 ms returned sat
[2026-05-25 03:30:19] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:30:23] [INFO ] [Real]Absence check using state equation in 4409 ms returned unknown
[2026-05-25 03:30:24] [INFO ] [Real]Absence check using 51 positive place invariants in 90 ms returned sat
[2026-05-25 03:30:24] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:30:28] [INFO ] [Real]Absence check using state equation in 4259 ms returned sat
[2026-05-25 03:30:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:30:29] [INFO ] [Nat]Absence check using 51 positive place invariants in 92 ms returned sat
[2026-05-25 03:30:29] [INFO ] [Nat]Absence check using 51 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:30:34] [INFO ] [Nat]Absence check using state equation in 4402 ms returned sat
[2026-05-25 03:30:34] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2026-05-25 03:30:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:866)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 03:30:34] [INFO ] [Real]Absence check using 51 positive place invariants in 86 ms returned sat
[2026-05-25 03:30:34] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:30:39] [INFO ] [Real]Absence check using state equation in 4422 ms returned unknown
[2026-05-25 03:30:39] [INFO ] [Real]Absence check using 51 positive place invariants in 85 ms returned sat
[2026-05-25 03:30:39] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:30:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 03:30:44] [INFO ] [Real]Absence check using 51 positive place invariants in 88 ms returned sat
[2026-05-25 03:30:44] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:30:49] [INFO ] [Real]Absence check using state equation in 4397 ms returned unknown
[2026-05-25 03:30:49] [INFO ] [Real]Absence check using 51 positive place invariants in 85 ms returned sat
[2026-05-25 03:30:49] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:30:54] [INFO ] [Real]Absence check using state equation in 4445 ms returned unknown
[2026-05-25 03:30:54] [INFO ] [Real]Absence check using 51 positive place invariants in 82 ms returned sat
[2026-05-25 03:30:54] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:30:59] [INFO ] [Real]Absence check using state equation in 4443 ms returned unknown
[2026-05-25 03:30:59] [INFO ] [Real]Absence check using 51 positive place invariants in 86 ms returned sat
[2026-05-25 03:30:59] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:31:04] [INFO ] [Real]Absence check using state equation in 4461 ms returned unknown
[2026-05-25 03:31:04] [INFO ] [Real]Absence check using 51 positive place invariants in 82 ms returned sat
[2026-05-25 03:31:04] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:31:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 03:31:09] [INFO ] [Real]Absence check using 51 positive place invariants in 85 ms returned sat
[2026-05-25 03:31:09] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:31:14] [INFO ] [Real]Absence check using state equation in 4457 ms returned unknown
[2026-05-25 03:31:14] [INFO ] [Real]Absence check using 51 positive place invariants in 86 ms returned sat
[2026-05-25 03:31:14] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:31:19] [INFO ] [Real]Absence check using state equation in 4432 ms returned unknown
[2026-05-25 03:31:19] [INFO ] [Real]Absence check using 51 positive place invariants in 81 ms returned sat
[2026-05-25 03:31:19] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:31:24] [INFO ] [Real]Absence check using state equation in 4438 ms returned unknown
[2026-05-25 03:31:24] [INFO ] [Real]Absence check using 51 positive place invariants in 85 ms returned sat
[2026-05-25 03:31:24] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:31:29] [INFO ] [Real]Absence check using state equation in 4450 ms returned unknown
[2026-05-25 03:31:29] [INFO ] [Real]Absence check using 51 positive place invariants in 86 ms returned sat
[2026-05-25 03:31:29] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:31:34] [INFO ] [Real]Absence check using state equation in 4449 ms returned unknown
[2026-05-25 03:31:34] [INFO ] [Real]Absence check using 51 positive place invariants in 85 ms returned sat
[2026-05-25 03:31:34] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:31:38] [INFO ] [Real]Absence check using state equation in 4079 ms returned sat
[2026-05-25 03:31:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:866)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 16 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Graph (complete) has 20751 edges and 5604 vertex of which 5603 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.23 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 351 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 701 place count 5253 transition count 14950
Performed 2444 Post agglomeration using F-continuation condition.Transition count delta: 2444
Deduced a syphon composed of 2444 places in 7 ms
Reduce places removed 2444 places and 0 transitions.
Iterating global reduction 2 with 4888 rules applied. Total rules applied 5589 place count 2809 transition count 12506
Drop transitions (Redundant composition of simpler transitions.) removed 2346 transitions
Redundant transition composition rules discarded 2346 transitions
Iterating global reduction 2 with 2346 rules applied. Total rules applied 7935 place count 2809 transition count 10160
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7936 place count 2809 transition count 10159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7937 place count 2808 transition count 10159
Partial Free-agglomeration rule applied 2541 times.
Drop transitions (Partial Free agglomeration) removed 2541 transitions
Iterating global reduction 3 with 2541 rules applied. Total rules applied 10478 place count 2808 transition count 10159
Applied a total of 10478 rules in 3498 ms. Remains 2808 /5604 variables (removed 2796) and now considering 10159/15300 (removed 5141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3509 ms. Remains : 2808/5604 places, 10159/15300 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2756628232944060995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15970332575977396963.kers'
[2026-05-25 03:31:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2756628232944060995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15970332575977396963.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 03:31:43] [INFO ] Computed 52 invariants in 133 ms
Computed 52 P flows in 134 ms.
Exported basis to /tmp/petrispot-output-15970332575977396963.kers
Total runtime 141 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 1000000 steps (4348 resets) in 14723 ms. (67 steps per ms)
BEST_FIRST walk for 16000016 steps (1112 resets) in 21245 ms. (753 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2026-05-25 03:32:19] [INFO ] Invariant cache hit.
[2026-05-25 03:32:19] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:32:19] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:32:21] [INFO ] [Real]Absence check using state equation in 1917 ms returned sat
[2026-05-25 03:32:21] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 03:32:22] [INFO ] [Real]Added 9982 Read/Feed constraints in 1343 ms returned sat
[2026-05-25 03:32:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:32:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:32:23] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:32:25] [INFO ] [Nat]Absence check using state equation in 1875 ms returned sat
[2026-05-25 03:32:26] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1258 ms returned sat
[2026-05-25 03:32:27] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 582 ms.
[2026-05-25 03:32:29] [INFO ] Added : 7 causal constraints over 2 iterations in 2394 ms. Result :sat
Minimization took 5115 ms.
[2026-05-25 03:32:34] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2026-05-25 03:32:34] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:32:36] [INFO ] [Real]Absence check using state equation in 1986 ms returned sat
[2026-05-25 03:32:37] [INFO ] [Real]Added 9982 Read/Feed constraints in 1061 ms returned sat
[2026-05-25 03:32:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:32:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:32:38] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:32:40] [INFO ] [Nat]Absence check using state equation in 1990 ms returned sat
[2026-05-25 03:32:41] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1510 ms returned sat
[2026-05-25 03:32:42] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 483 ms.
[2026-05-25 03:32:44] [INFO ] Added : 6 causal constraints over 2 iterations in 2329 ms. Result :sat
Minimization took 5086 ms.
[2026-05-25 03:32:49] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:32:49] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:32:51] [INFO ] [Real]Absence check using state equation in 1894 ms returned sat
[2026-05-25 03:32:53] [INFO ] [Real]Added 9982 Read/Feed constraints in 1292 ms returned sat
[2026-05-25 03:32:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:32:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:32:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:32:55] [INFO ] [Nat]Absence check using state equation in 1905 ms returned sat
[2026-05-25 03:32:57] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1490 ms returned sat
[2026-05-25 03:32:57] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 521 ms.
[2026-05-25 03:32:59] [INFO ] Added : 8 causal constraints over 2 iterations in 2241 ms. Result :sat
Minimization took 5076 ms.
[2026-05-25 03:33:04] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:33:04] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:33:06] [INFO ] [Real]Absence check using state equation in 2090 ms returned sat
[2026-05-25 03:33:08] [INFO ] [Real]Added 9982 Read/Feed constraints in 1288 ms returned sat
[2026-05-25 03:33:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:33:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:33:08] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:33:10] [INFO ] [Nat]Absence check using state equation in 2081 ms returned sat
[2026-05-25 03:33:12] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1436 ms returned sat
[2026-05-25 03:33:12] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 423 ms.
[2026-05-25 03:33:14] [INFO ] Added : 9 causal constraints over 2 iterations in 2216 ms. Result :sat
Minimization took 5082 ms.
[2026-05-25 03:33:20] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:33:20] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:33:22] [INFO ] [Real]Absence check using state equation in 2220 ms returned sat
[2026-05-25 03:33:23] [INFO ] [Real]Added 9982 Read/Feed constraints in 1281 ms returned sat
[2026-05-25 03:33:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:33:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 03:33:24] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:33:26] [INFO ] [Nat]Absence check using state equation in 2324 ms returned sat
[2026-05-25 03:33:28] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1646 ms returned sat
[2026-05-25 03:33:29] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 497 ms.
[2026-05-25 03:33:30] [INFO ] Added : 6 causal constraints over 2 iterations in 2246 ms. Result :sat
Minimization took 5069 ms.
[2026-05-25 03:33:36] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:33:36] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:33:38] [INFO ] [Real]Absence check using state equation in 2055 ms returned sat
[2026-05-25 03:33:40] [INFO ] [Real]Added 9982 Read/Feed constraints in 1618 ms returned sat
[2026-05-25 03:33:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:33:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:33:40] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:33:42] [INFO ] [Nat]Absence check using state equation in 1934 ms returned sat
[2026-05-25 03:33:44] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1638 ms returned sat
[2026-05-25 03:33:44] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 440 ms.
[2026-05-25 03:33:46] [INFO ] Added : 8 causal constraints over 2 iterations in 2091 ms. Result :sat
Minimization took 5073 ms.
[2026-05-25 03:33:51] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:33:51] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:33:53] [INFO ] [Real]Absence check using state equation in 1940 ms returned sat
[2026-05-25 03:33:55] [INFO ] [Real]Added 9982 Read/Feed constraints in 1081 ms returned sat
[2026-05-25 03:33:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:33:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:33:55] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:33:57] [INFO ] [Nat]Absence check using state equation in 1965 ms returned sat
[2026-05-25 03:33:59] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1852 ms returned sat
[2026-05-25 03:33:59] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 462 ms.
[2026-05-25 03:34:01] [INFO ] Added : 7 causal constraints over 2 iterations in 2135 ms. Result :sat
Minimization took 5074 ms.
[2026-05-25 03:34:07] [INFO ] [Real]Absence check using 50 positive place invariants in 37 ms returned sat
[2026-05-25 03:34:07] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:34:08] [INFO ] [Real]Absence check using state equation in 1931 ms returned sat
[2026-05-25 03:34:10] [INFO ] [Real]Added 9982 Read/Feed constraints in 1084 ms returned sat
[2026-05-25 03:34:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:34:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:34:10] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:34:12] [INFO ] [Nat]Absence check using state equation in 1998 ms returned sat
[2026-05-25 03:34:14] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1544 ms returned sat
[2026-05-25 03:34:14] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 444 ms.
[2026-05-25 03:34:16] [INFO ] Added : 7 causal constraints over 2 iterations in 2157 ms. Result :sat
Minimization took 5080 ms.
[2026-05-25 03:34:21] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:34:21] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:34:23] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2026-05-25 03:34:25] [INFO ] [Real]Added 9982 Read/Feed constraints in 1116 ms returned sat
[2026-05-25 03:34:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:34:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:34:25] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:34:27] [INFO ] [Nat]Absence check using state equation in 1979 ms returned sat
[2026-05-25 03:34:29] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1438 ms returned sat
[2026-05-25 03:34:29] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 482 ms.
[2026-05-25 03:34:31] [INFO ] Added : 6 causal constraints over 2 iterations in 2312 ms. Result :sat
Minimization took 5075 ms.
[2026-05-25 03:34:37] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:34:37] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:34:39] [INFO ] [Real]Absence check using state equation in 2056 ms returned sat
[2026-05-25 03:34:40] [INFO ] [Real]Added 9982 Read/Feed constraints in 1252 ms returned sat
[2026-05-25 03:34:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:34:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 03:34:41] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:34:43] [INFO ] [Nat]Absence check using state equation in 2105 ms returned sat
[2026-05-25 03:34:45] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1806 ms returned sat
[2026-05-25 03:34:45] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 529 ms.
[2026-05-25 03:34:47] [INFO ] Added : 7 causal constraints over 2 iterations in 2283 ms. Result :sat
Minimization took 5287 ms.
[2026-05-25 03:34:53] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:34:53] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:34:55] [INFO ] [Real]Absence check using state equation in 2158 ms returned sat
[2026-05-25 03:34:56] [INFO ] [Real]Added 9982 Read/Feed constraints in 1158 ms returned sat
[2026-05-25 03:34:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:34:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:34:57] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:34:59] [INFO ] [Nat]Absence check using state equation in 2053 ms returned sat
[2026-05-25 03:35:00] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1564 ms returned sat
[2026-05-25 03:35:01] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 432 ms.
[2026-05-25 03:35:03] [INFO ] Added : 7 causal constraints over 2 iterations in 2203 ms. Result :sat
Minimization took 5077 ms.
[2026-05-25 03:35:08] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:35:08] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:35:10] [INFO ] [Real]Absence check using state equation in 2255 ms returned sat
[2026-05-25 03:35:11] [INFO ] [Real]Added 9982 Read/Feed constraints in 983 ms returned sat
[2026-05-25 03:35:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:35:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2026-05-25 03:35:12] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:35:14] [INFO ] [Nat]Absence check using state equation in 2294 ms returned sat
[2026-05-25 03:35:16] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1694 ms returned sat
[2026-05-25 03:35:17] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 487 ms.
[2026-05-25 03:35:18] [INFO ] Added : 6 causal constraints over 2 iterations in 2239 ms. Result :sat
Minimization took 5077 ms.
[2026-05-25 03:35:24] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:35:24] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:35:26] [INFO ] [Real]Absence check using state equation in 1947 ms returned sat
[2026-05-25 03:35:27] [INFO ] [Real]Added 9982 Read/Feed constraints in 1230 ms returned sat
[2026-05-25 03:35:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:35:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:35:28] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:35:30] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2026-05-25 03:35:31] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1679 ms returned sat
[2026-05-25 03:35:32] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 452 ms.
[2026-05-25 03:35:34] [INFO ] Added : 9 causal constraints over 2 iterations in 2308 ms. Result :sat
Minimization took 5080 ms.
[2026-05-25 03:35:39] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:35:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:35:41] [INFO ] [Real]Absence check using state equation in 1968 ms returned sat
[2026-05-25 03:35:42] [INFO ] [Real]Added 9982 Read/Feed constraints in 1075 ms returned sat
[2026-05-25 03:35:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:35:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:35:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:35:45] [INFO ] [Nat]Absence check using state equation in 1989 ms returned sat
[2026-05-25 03:35:46] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1316 ms returned sat
[2026-05-25 03:35:47] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 432 ms.
[2026-05-25 03:35:49] [INFO ] Added : 6 causal constraints over 2 iterations in 2201 ms. Result :sat
Minimization took 5081 ms.
[2026-05-25 03:35:54] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:35:54] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:35:56] [INFO ] [Real]Absence check using state equation in 2075 ms returned sat
[2026-05-25 03:35:57] [INFO ] [Real]Added 9982 Read/Feed constraints in 948 ms returned sat
[2026-05-25 03:35:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:35:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:35:58] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:36:00] [INFO ] [Nat]Absence check using state equation in 2103 ms returned sat
[2026-05-25 03:36:01] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1466 ms returned sat
[2026-05-25 03:36:02] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 452 ms.
[2026-05-25 03:36:04] [INFO ] Added : 9 causal constraints over 2 iterations in 2292 ms. Result :sat
Minimization took 5082 ms.
[2026-05-25 03:36:09] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:36:09] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:36:11] [INFO ] [Real]Absence check using state equation in 1976 ms returned sat
[2026-05-25 03:36:12] [INFO ] [Real]Added 9982 Read/Feed constraints in 1164 ms returned sat
[2026-05-25 03:36:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:36:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:36:13] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:36:15] [INFO ] [Nat]Absence check using state equation in 2010 ms returned sat
[2026-05-25 03:36:17] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1818 ms returned sat
[2026-05-25 03:36:17] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 476 ms.
[2026-05-25 03:36:19] [INFO ] Added : 8 causal constraints over 2 iterations in 2297 ms. Result :sat
Minimization took 5077 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 16 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 418 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 2808/2808 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 399 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2026-05-25 03:36:25] [INFO ] Invariant cache hit.
[2026-05-25 03:36:29] [INFO ] Implicit Places using invariants in 3613 ms returned []
Implicit Place search using SMT only with invariants took 3614 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2026-05-25 03:36:29] [INFO ] Invariant cache hit.
[2026-05-25 03:36:29] [INFO ] State equation strengthened by 9982 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2807 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 40512ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 40573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44651 ms. Remains : 2808/2808 places, 10159/10159 transitions.
[2026-05-25 03:37:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 1000000 steps (4342 resets) in 15340 ms. (65 steps per ms)
BEST_FIRST walk for 16000016 steps (1107 resets) in 21792 ms. (734 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2026-05-25 03:37:47] [INFO ] Invariant cache hit.
[2026-05-25 03:37:47] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:37:47] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:37:49] [INFO ] [Real]Absence check using state equation in 1984 ms returned sat
[2026-05-25 03:37:49] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 03:37:50] [INFO ] [Real]Added 9982 Read/Feed constraints in 1300 ms returned sat
[2026-05-25 03:37:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:37:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:37:51] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:37:53] [INFO ] [Nat]Absence check using state equation in 1998 ms returned sat
[2026-05-25 03:37:54] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1280 ms returned sat
[2026-05-25 03:37:55] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 440 ms.
[2026-05-25 03:37:57] [INFO ] Added : 7 causal constraints over 2 iterations in 2171 ms. Result :sat
Minimization took 5069 ms.
[2026-05-25 03:38:02] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:38:02] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:38:04] [INFO ] [Real]Absence check using state equation in 2029 ms returned sat
[2026-05-25 03:38:05] [INFO ] [Real]Added 9982 Read/Feed constraints in 1078 ms returned sat
[2026-05-25 03:38:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:38:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2026-05-25 03:38:06] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:38:08] [INFO ] [Nat]Absence check using state equation in 1957 ms returned sat
[2026-05-25 03:38:09] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1466 ms returned sat
[2026-05-25 03:38:10] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 441 ms.
[2026-05-25 03:38:11] [INFO ] Added : 6 causal constraints over 2 iterations in 2186 ms. Result :sat
Minimization took 5072 ms.
[2026-05-25 03:38:17] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:38:17] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:38:19] [INFO ] [Real]Absence check using state equation in 1914 ms returned sat
[2026-05-25 03:38:20] [INFO ] [Real]Added 9982 Read/Feed constraints in 1288 ms returned sat
[2026-05-25 03:38:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:38:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:38:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:38:23] [INFO ] [Nat]Absence check using state equation in 1982 ms returned sat
[2026-05-25 03:38:24] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1510 ms returned sat
[2026-05-25 03:38:25] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 418 ms.
[2026-05-25 03:38:27] [INFO ] Added : 8 causal constraints over 2 iterations in 2156 ms. Result :sat
Minimization took 5075 ms.
[2026-05-25 03:38:32] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:38:32] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:38:34] [INFO ] [Real]Absence check using state equation in 2069 ms returned sat
[2026-05-25 03:38:35] [INFO ] [Real]Added 9982 Read/Feed constraints in 1274 ms returned sat
[2026-05-25 03:38:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:38:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:38:36] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:38:38] [INFO ] [Nat]Absence check using state equation in 2125 ms returned sat
[2026-05-25 03:38:40] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1446 ms returned sat
[2026-05-25 03:38:40] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 441 ms.
[2026-05-25 03:38:42] [INFO ] Added : 9 causal constraints over 2 iterations in 2217 ms. Result :sat
Minimization took 5076 ms.
[2026-05-25 03:38:47] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:38:47] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:38:49] [INFO ] [Real]Absence check using state equation in 2194 ms returned sat
[2026-05-25 03:38:51] [INFO ] [Real]Added 9982 Read/Feed constraints in 1220 ms returned sat
[2026-05-25 03:38:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:38:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:38:51] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:38:54] [INFO ] [Nat]Absence check using state equation in 2188 ms returned sat
[2026-05-25 03:38:55] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1583 ms returned sat
[2026-05-25 03:38:56] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 437 ms.
[2026-05-25 03:38:57] [INFO ] Added : 6 causal constraints over 2 iterations in 2114 ms. Result :sat
Minimization took 5068 ms.
[2026-05-25 03:39:03] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 03:39:03] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:39:05] [INFO ] [Real]Absence check using state equation in 1935 ms returned sat
[2026-05-25 03:39:07] [INFO ] [Real]Added 9982 Read/Feed constraints in 1554 ms returned sat
[2026-05-25 03:39:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:39:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:39:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:39:09] [INFO ] [Nat]Absence check using state equation in 1986 ms returned sat
[2026-05-25 03:39:11] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1697 ms returned sat
[2026-05-25 03:39:11] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 431 ms.
[2026-05-25 03:39:13] [INFO ] Added : 8 causal constraints over 2 iterations in 2115 ms. Result :sat
Minimization took 5075 ms.
[2026-05-25 03:39:18] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:39:18] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:39:20] [INFO ] [Real]Absence check using state equation in 1934 ms returned sat
[2026-05-25 03:39:22] [INFO ] [Real]Added 9982 Read/Feed constraints in 1082 ms returned sat
[2026-05-25 03:39:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:39:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:39:22] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:39:24] [INFO ] [Nat]Absence check using state equation in 2023 ms returned sat
[2026-05-25 03:39:26] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1871 ms returned sat
[2026-05-25 03:39:27] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 433 ms.
[2026-05-25 03:39:28] [INFO ] Added : 7 causal constraints over 2 iterations in 2095 ms. Result :sat
Minimization took 5071 ms.
[2026-05-25 03:39:34] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:39:34] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:39:36] [INFO ] [Real]Absence check using state equation in 2032 ms returned sat
[2026-05-25 03:39:37] [INFO ] [Real]Added 9982 Read/Feed constraints in 1098 ms returned sat
[2026-05-25 03:39:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:39:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 03:39:37] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:39:39] [INFO ] [Nat]Absence check using state equation in 2054 ms returned sat
[2026-05-25 03:39:41] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1577 ms returned sat
[2026-05-25 03:39:42] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 440 ms.
[2026-05-25 03:39:43] [INFO ] Added : 7 causal constraints over 2 iterations in 2135 ms. Result :sat
Minimization took 5075 ms.
[2026-05-25 03:39:49] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:39:49] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 7 ms returned sat
[2026-05-25 03:39:51] [INFO ] [Real]Absence check using state equation in 1944 ms returned sat
[2026-05-25 03:39:52] [INFO ] [Real]Added 9982 Read/Feed constraints in 1125 ms returned sat
[2026-05-25 03:39:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:39:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:39:52] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:39:54] [INFO ] [Nat]Absence check using state equation in 1977 ms returned sat
[2026-05-25 03:39:56] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1318 ms returned sat
[2026-05-25 03:39:56] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 425 ms.
[2026-05-25 03:39:58] [INFO ] Added : 6 causal constraints over 2 iterations in 2153 ms. Result :sat
Minimization took 5073 ms.
[2026-05-25 03:40:03] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:40:04] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:40:05] [INFO ] [Real]Absence check using state equation in 1923 ms returned sat
[2026-05-25 03:40:07] [INFO ] [Real]Added 9982 Read/Feed constraints in 1187 ms returned sat
[2026-05-25 03:40:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:40:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:40:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:40:09] [INFO ] [Nat]Absence check using state equation in 1940 ms returned sat
[2026-05-25 03:40:11] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1742 ms returned sat
[2026-05-25 03:40:12] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 437 ms.
[2026-05-25 03:40:13] [INFO ] Added : 7 causal constraints over 2 iterations in 2122 ms. Result :sat
Minimization took 5080 ms.
[2026-05-25 03:40:19] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:40:19] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:40:21] [INFO ] [Real]Absence check using state equation in 1955 ms returned sat
[2026-05-25 03:40:22] [INFO ] [Real]Added 9982 Read/Feed constraints in 1136 ms returned sat
[2026-05-25 03:40:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:40:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:40:22] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:40:24] [INFO ] [Nat]Absence check using state equation in 1964 ms returned sat
[2026-05-25 03:40:26] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1512 ms returned sat
[2026-05-25 03:40:27] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 432 ms.
[2026-05-25 03:40:28] [INFO ] Added : 7 causal constraints over 2 iterations in 2177 ms. Result :sat
Minimization took 5079 ms.
[2026-05-25 03:40:34] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:40:34] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:40:36] [INFO ] [Real]Absence check using state equation in 2120 ms returned sat
[2026-05-25 03:40:37] [INFO ] [Real]Added 9982 Read/Feed constraints in 936 ms returned sat
[2026-05-25 03:40:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:40:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:40:37] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:40:40] [INFO ] [Nat]Absence check using state equation in 2207 ms returned sat
[2026-05-25 03:40:41] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1614 ms returned sat
[2026-05-25 03:40:42] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 418 ms.
[2026-05-25 03:40:43] [INFO ] Added : 6 causal constraints over 2 iterations in 2073 ms. Result :sat
Minimization took 5074 ms.
[2026-05-25 03:40:49] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:40:49] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:40:51] [INFO ] [Real]Absence check using state equation in 1985 ms returned sat
[2026-05-25 03:40:52] [INFO ] [Real]Added 9982 Read/Feed constraints in 1236 ms returned sat
[2026-05-25 03:40:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:40:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:40:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:40:55] [INFO ] [Nat]Absence check using state equation in 1948 ms returned sat
[2026-05-25 03:40:56] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1596 ms returned sat
[2026-05-25 03:40:57] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 410 ms.
[2026-05-25 03:40:59] [INFO ] Added : 9 causal constraints over 2 iterations in 2188 ms. Result :sat
Minimization took 5076 ms.
[2026-05-25 03:41:04] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:41:04] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:41:06] [INFO ] [Real]Absence check using state equation in 1944 ms returned sat
[2026-05-25 03:41:07] [INFO ] [Real]Added 9982 Read/Feed constraints in 1027 ms returned sat
[2026-05-25 03:41:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:41:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:41:08] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:41:10] [INFO ] [Nat]Absence check using state equation in 1948 ms returned sat
[2026-05-25 03:41:11] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1244 ms returned sat
[2026-05-25 03:41:11] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 424 ms.
[2026-05-25 03:41:13] [INFO ] Added : 6 causal constraints over 2 iterations in 2102 ms. Result :sat
Minimization took 5076 ms.
[2026-05-25 03:41:18] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:41:18] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:41:21] [INFO ] [Real]Absence check using state equation in 2243 ms returned sat
[2026-05-25 03:41:22] [INFO ] [Real]Added 9982 Read/Feed constraints in 1050 ms returned sat
[2026-05-25 03:41:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:41:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:41:23] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:41:25] [INFO ] [Nat]Absence check using state equation in 2336 ms returned sat
[2026-05-25 03:41:26] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1641 ms returned sat
[2026-05-25 03:41:27] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 489 ms.
[2026-05-25 03:41:29] [INFO ] Added : 9 causal constraints over 2 iterations in 2428 ms. Result :sat
Minimization took 5315 ms.
[2026-05-25 03:41:35] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:41:35] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:41:37] [INFO ] [Real]Absence check using state equation in 2190 ms returned sat
[2026-05-25 03:41:38] [INFO ] [Real]Added 9982 Read/Feed constraints in 1291 ms returned sat
[2026-05-25 03:41:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:41:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:41:39] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:41:41] [INFO ] [Nat]Absence check using state equation in 2033 ms returned sat
[2026-05-25 03:41:43] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1875 ms returned sat
[2026-05-25 03:41:43] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 434 ms.
[2026-05-25 03:41:45] [INFO ] Added : 8 causal constraints over 2 iterations in 2234 ms. Result :sat
Minimization took 5066 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 16 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 379 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 2808/2808 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 367 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2026-05-25 03:41:51] [INFO ] Invariant cache hit.
[2026-05-25 03:41:55] [INFO ] Implicit Places using invariants in 3642 ms returned []
Implicit Place search using SMT only with invariants took 3643 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4016 ms. Remains : 2808/2808 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (170 resets) in 1996 ms. (20 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
[2026-05-25 03:41:56] [INFO ] Flatten gal took : 791 ms
[2026-05-25 03:41:56] [INFO ] Flatten gal took : 321 ms
[2026-05-25 03:41:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10044780092306970685.gal : 116 ms
[2026-05-25 03:41:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12036919449008550006.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10044780092306970685.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12036919449008550006.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12036919449008550006.prop.
Interrupted probabilistic random walk after 66633 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 32
Probabilistic random walk after 66633 steps, saw 26966 distinct states, run finished after 3005 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-25 03:41:59] [INFO ] Invariant cache hit.
[2026-05-25 03:41:59] [INFO ] State equation strengthened by 9982 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2690/2706 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
Problem MAX15 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2706 variables, 1/2 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2706 variables, 0/2 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 98/2804 variables, 49/51 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2804 variables, 0/51 constraints. Problems are: Problem set: 16 solved, 16 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 2/2806 variables, 2/53 constraints. Problems are: Problem set: 16 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2806/12967 variables, and 53 constraints, problems are : Problem set: 16 solved, 16 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/2808 constraints, ReadFeed: 0/9982 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 2690/2706 variables, 1/1 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2706 variables, 1/2 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2706 variables, 0/2 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 98/2804 variables, 49/51 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2804 variables, 0/51 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 2/2806 variables, 2/53 constraints. Problems are: Problem set: 16 solved, 16 unsolved
SMT process timed out in 11308ms, After SMT, problems are : Problem set: 16 solved, 16 unsolved
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 399 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 2808/2808 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (173 resets) in 1305 ms. (30 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 69438 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 16
Probabilistic random walk after 69438 steps, saw 27323 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2026-05-25 03:42:14] [INFO ] Invariant cache hit.
[2026-05-25 03:42:14] [INFO ] State equation strengthened by 9982 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 2690/2706 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2706 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2706 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 98/2804 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2804 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/2806 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2806 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 10159/12965 variables, 2806/2860 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12965 variables, 9982/12842 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12965 variables, 0/12842 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 2/12967 variables, 2/12844 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12967 variables, 0/12844 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Detected timeout of ITS tools.
[2026-05-25 03:42:47] [INFO ] Flatten gal took : 170 ms
[2026-05-25 03:42:47] [INFO ] Applying decomposition
[2026-05-25 03:42:47] [INFO ] Flatten gal took : 172 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/graph13502154303394435448.txt' '-o' '/tmp/graph13502154303394435448.bin' '-w' '/tmp/graph13502154303394435448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13502154303394435448.bin' '-l' '-1' '-v' '-w' '/tmp/graph13502154303394435448.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:42:48] [INFO ] Decomposing Gal with order
[2026-05-25 03:42:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:42:49] [INFO ] Removed a total of 7676 redundant transitions.
[2026-05-25 03:42:49] [INFO ] Flatten gal took : 1103 ms
[2026-05-25 03:42:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 8532 labels/synchronizations in 711 ms.
[2026-05-25 03:42:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16800274961487949183.gal : 85 ms
[2026-05-25 03:42:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4716189031654078549.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16800274961487949183.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4716189031654078549.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
At refinement iteration 13 (OVERLAPS) 0/12967 variables, 0/12844 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Loading property file /tmp/ReachabilityCardinality4716189031654078549.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4840
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4840 after 4840
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4840 after 4840
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :4840 after 4840
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :4840 after 4840
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :4840 after 4851
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :4851 after 4853
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :4853 after 4858
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :4858 after 4865
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :4865 after 4874
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :4874 after 4890
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :4890 after 4911
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :4911 after 4953
No progress, stopping.
After SMT solving in domain Real declared 12967/12967 variables, and 12844 constraints, problems are : Problem set: 0 solved, 16 unsolved in 43006 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2808/2808 constraints, ReadFeed: 9982/9982 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 2690/2706 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2706 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2706 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 98/2804 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2804 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 2/2806 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :4953 after 17568
At refinement iteration 7 (INCLUDED_ONLY) 0/2806 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2806 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 10159/12965 variables, 2806/2862 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12965 variables, 9982/12844 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 12965/12967 variables, and 12860 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45088 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2806/2808 constraints, ReadFeed: 9982/9982 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88144ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 363 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 2808/2808 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 363 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2026-05-25 03:43:43] [INFO ] Invariant cache hit.
[2026-05-25 03:43:46] [INFO ] Implicit Places using invariants in 3495 ms returned []
Implicit Place search using SMT only with invariants took 3496 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3862 ms. Remains : 2808/2808 places, 10159/10159 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49]
[2026-05-25 03:43:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49]
RANDOM walk for 1000000 steps (4351 resets) in 14292 ms. (69 steps per ms)
BEST_FIRST walk for 16000016 steps (1111 resets) in 21069 ms. (759 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49]
[2026-05-25 03:44:22] [INFO ] Invariant cache hit.
[2026-05-25 03:44:22] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:44:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 03:44:24] [INFO ] [Real]Absence check using state equation in 1909 ms returned sat
[2026-05-25 03:44:24] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 03:44:25] [INFO ] [Real]Added 9982 Read/Feed constraints in 1257 ms returned sat
[2026-05-25 03:44:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:44:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:44:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:44:28] [INFO ] [Nat]Absence check using state equation in 1946 ms returned sat
[2026-05-25 03:44:29] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1277 ms returned sat
[2026-05-25 03:44:30] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 437 ms.
[2026-05-25 03:44:32] [INFO ] Added : 7 causal constraints over 2 iterations in 2150 ms. Result :sat
Minimization took 5072 ms.
[2026-05-25 03:44:37] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:44:37] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:44:39] [INFO ] [Real]Absence check using state equation in 2017 ms returned sat
[2026-05-25 03:44:40] [INFO ] [Real]Added 9982 Read/Feed constraints in 1116 ms returned sat
[2026-05-25 03:44:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:44:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:44:41] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:44:43] [INFO ] [Nat]Absence check using state equation in 2064 ms returned sat
[2026-05-25 03:44:44] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1496 ms returned sat
[2026-05-25 03:44:45] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 429 ms.
[2026-05-25 03:44:47] [INFO ] Added : 6 causal constraints over 2 iterations in 2212 ms. Result :sat
Minimization took 5088 ms.
[2026-05-25 03:44:52] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:44:52] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:44:54] [INFO ] [Real]Absence check using state equation in 1932 ms returned sat
[2026-05-25 03:44:56] [INFO ] [Real]Added 9982 Read/Feed constraints in 1327 ms returned sat
[2026-05-25 03:44:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:44:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:44:56] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:44:58] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2026-05-25 03:45:00] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1553 ms returned sat
[2026-05-25 03:45:00] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 430 ms.
[2026-05-25 03:45:02] [INFO ] Added : 8 causal constraints over 2 iterations in 2219 ms. Result :sat
Minimization took 5083 ms.
[2026-05-25 03:45:07] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:45:07] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:45:09] [INFO ] [Real]Absence check using state equation in 2109 ms returned sat
[2026-05-25 03:45:11] [INFO ] [Real]Added 9982 Read/Feed constraints in 1295 ms returned sat
[2026-05-25 03:45:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:45:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:45:11] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:45:14] [INFO ] [Nat]Absence check using state equation in 2165 ms returned sat
[2026-05-25 03:45:15] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1438 ms returned sat
[2026-05-25 03:45:16] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 449 ms.
[2026-05-25 03:45:17] [INFO ] Added : 9 causal constraints over 2 iterations in 2236 ms. Result :sat
Minimization took 5079 ms.
[2026-05-25 03:45:23] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:45:23] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:45:25] [INFO ] [Real]Absence check using state equation in 2177 ms returned sat
[2026-05-25 03:45:26] [INFO ] [Real]Added 9982 Read/Feed constraints in 1238 ms returned sat
[2026-05-25 03:45:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:45:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:45:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:45:29] [INFO ] [Nat]Absence check using state equation in 2183 ms returned sat
[2026-05-25 03:45:31] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1612 ms returned sat
[2026-05-25 03:45:31] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 440 ms.
[2026-05-25 03:45:33] [INFO ] Added : 6 causal constraints over 2 iterations in 2134 ms. Result :sat
Minimization took 5075 ms.
[2026-05-25 03:45:38] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:45:38] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:45:40] [INFO ] [Real]Absence check using state equation in 1962 ms returned sat
[2026-05-25 03:45:42] [INFO ] [Real]Added 9982 Read/Feed constraints in 1558 ms returned sat
[2026-05-25 03:45:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:45:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:45:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:45:45] [INFO ] [Nat]Absence check using state equation in 1984 ms returned sat
[2026-05-25 03:45:46] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1655 ms returned sat
[2026-05-25 03:45:47] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 443 ms.
[2026-05-25 03:45:49] [INFO ] Added : 8 causal constraints over 2 iterations in 2183 ms. Result :sat
Minimization took 5307 ms.
[2026-05-25 03:45:54] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:45:54] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:45:56] [INFO ] [Real]Absence check using state equation in 1987 ms returned sat
[2026-05-25 03:45:57] [INFO ] [Real]Added 9982 Read/Feed constraints in 1093 ms returned sat
[2026-05-25 03:45:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:45:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:45:58] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:46:00] [INFO ] [Nat]Absence check using state equation in 2011 ms returned sat
[2026-05-25 03:46:02] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1893 ms returned sat
[2026-05-25 03:46:03] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 454 ms.
[2026-05-25 03:46:04] [INFO ] Added : 7 causal constraints over 2 iterations in 2159 ms. Result :sat
Minimization took 5077 ms.
[2026-05-25 03:46:10] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:46:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:46:12] [INFO ] [Real]Absence check using state equation in 2082 ms returned sat
[2026-05-25 03:46:13] [INFO ] [Real]Added 9982 Read/Feed constraints in 1103 ms returned sat
[2026-05-25 03:46:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:46:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:46:13] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:46:16] [INFO ] [Nat]Absence check using state equation in 2050 ms returned sat
[2026-05-25 03:46:17] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1568 ms returned sat
[2026-05-25 03:46:18] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 449 ms.
[2026-05-25 03:46:19] [INFO ] Added : 7 causal constraints over 2 iterations in 2124 ms. Result :sat
Minimization took 5064 ms.
[2026-05-25 03:46:25] [INFO ] [Real]Absence check using 50 positive place invariants in 37 ms returned sat
[2026-05-25 03:46:25] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:46:27] [INFO ] [Real]Absence check using state equation in 1996 ms returned sat
[2026-05-25 03:46:28] [INFO ] [Real]Added 9982 Read/Feed constraints in 1133 ms returned sat
[2026-05-25 03:46:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:46:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:46:29] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:46:31] [INFO ] [Nat]Absence check using state equation in 1962 ms returned sat
[2026-05-25 03:46:32] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1302 ms returned sat
[2026-05-25 03:46:32] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 427 ms.
[2026-05-25 03:46:34] [INFO ] Added : 6 causal constraints over 2 iterations in 2089 ms. Result :sat
Minimization took 5075 ms.
[2026-05-25 03:46:39] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:46:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:46:41] [INFO ] [Real]Absence check using state equation in 1955 ms returned sat
[2026-05-25 03:46:43] [INFO ] [Real]Added 9982 Read/Feed constraints in 1156 ms returned sat
[2026-05-25 03:46:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:46:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:46:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:46:45] [INFO ] [Nat]Absence check using state equation in 2002 ms returned sat
[2026-05-25 03:46:47] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1733 ms returned sat
[2026-05-25 03:46:48] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 462 ms.
[2026-05-25 03:46:49] [INFO ] Added : 7 causal constraints over 2 iterations in 2116 ms. Result :sat
Minimization took 5077 ms.
[2026-05-25 03:46:55] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:46:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:46:57] [INFO ] [Real]Absence check using state equation in 1966 ms returned sat
[2026-05-25 03:46:58] [INFO ] [Real]Added 9982 Read/Feed constraints in 1151 ms returned sat
[2026-05-25 03:46:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:46:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:46:58] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:47:01] [INFO ] [Nat]Absence check using state equation in 2031 ms returned sat
[2026-05-25 03:47:02] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1563 ms returned sat
[2026-05-25 03:47:03] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 439 ms.
[2026-05-25 03:47:04] [INFO ] Added : 7 causal constraints over 2 iterations in 2164 ms. Result :sat
Minimization took 5081 ms.
[2026-05-25 03:47:10] [INFO ] [Real]Absence check using 50 positive place invariants in 37 ms returned sat
[2026-05-25 03:47:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:47:12] [INFO ] [Real]Absence check using state equation in 2123 ms returned sat
[2026-05-25 03:47:13] [INFO ] [Real]Added 9982 Read/Feed constraints in 942 ms returned sat
[2026-05-25 03:47:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:47:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:47:14] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:47:16] [INFO ] [Nat]Absence check using state equation in 2184 ms returned sat
[2026-05-25 03:47:17] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1533 ms returned sat
[2026-05-25 03:47:18] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 438 ms.
[2026-05-25 03:47:19] [INFO ] Added : 6 causal constraints over 2 iterations in 2053 ms. Result :sat
Minimization took 5066 ms.
[2026-05-25 03:47:25] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:47:25] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:47:27] [INFO ] [Real]Absence check using state equation in 1996 ms returned sat
[2026-05-25 03:47:28] [INFO ] [Real]Added 9982 Read/Feed constraints in 1232 ms returned sat
[2026-05-25 03:47:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:47:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:47:29] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:47:31] [INFO ] [Nat]Absence check using state equation in 2007 ms returned sat
[2026-05-25 03:47:32] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1572 ms returned sat
[2026-05-25 03:47:33] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 430 ms.
[2026-05-25 03:47:35] [INFO ] Added : 9 causal constraints over 2 iterations in 2159 ms. Result :sat
Minimization took 5074 ms.
[2026-05-25 03:47:40] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:47:40] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:47:42] [INFO ] [Real]Absence check using state equation in 2003 ms returned sat
[2026-05-25 03:47:43] [INFO ] [Real]Added 9982 Read/Feed constraints in 1076 ms returned sat
[2026-05-25 03:47:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:47:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:47:44] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:47:46] [INFO ] [Nat]Absence check using state equation in 1968 ms returned sat
[2026-05-25 03:47:47] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1271 ms returned sat
[2026-05-25 03:47:48] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 450 ms.
[2026-05-25 03:47:49] [INFO ] Added : 6 causal constraints over 2 iterations in 2069 ms. Result :sat
Minimization took 5069 ms.
[2026-05-25 03:47:55] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:47:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:47:57] [INFO ] [Real]Absence check using state equation in 2143 ms returned sat
[2026-05-25 03:47:58] [INFO ] [Real]Added 9982 Read/Feed constraints in 972 ms returned sat
[2026-05-25 03:47:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:47:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:47:58] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 03:48:01] [INFO ] [Nat]Absence check using state equation in 2153 ms returned sat
[2026-05-25 03:48:02] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1485 ms returned sat
[2026-05-25 03:48:03] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 452 ms.
[2026-05-25 03:48:05] [INFO ] Added : 9 causal constraints over 2 iterations in 2300 ms. Result :sat
Minimization took 5074 ms.
[2026-05-25 03:48:10] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:48:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:48:12] [INFO ] [Real]Absence check using state equation in 1999 ms returned sat
[2026-05-25 03:48:13] [INFO ] [Real]Added 9982 Read/Feed constraints in 1189 ms returned sat
[2026-05-25 03:48:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:48:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 03:48:14] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:48:16] [INFO ] [Nat]Absence check using state equation in 2023 ms returned sat
[2026-05-25 03:48:18] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1852 ms returned sat
[2026-05-25 03:48:18] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 421 ms.
[2026-05-25 03:48:20] [INFO ] Added : 8 causal constraints over 2 iterations in 2213 ms. Result :sat
Minimization took 5061 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49]
Support contains 16 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 369 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 2808/2808 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 366 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2026-05-25 03:48:26] [INFO ] Invariant cache hit.
[2026-05-25 03:48:30] [INFO ] Implicit Places using invariants in 3622 ms returned []
Implicit Place search using SMT only with invariants took 3623 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3991 ms. Remains : 2808/2808 places, 10159/10159 transitions.
[2026-05-25 03:48:30] [INFO ] Flatten gal took : 134 ms
[2026-05-25 03:48:30] [INFO ] Flatten gal took : 207 ms
[2026-05-25 03:48:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9754293366071537512.gal : 35 ms
[2026-05-25 03:48:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3629051303088004339.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9754293366071537512.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3629051303088004339.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (171 resets) in 1771 ms. (22 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
Loading property file /tmp/ReachabilityCardinality3629051303088004339.prop.
Interrupted probabilistic random walk after 69742 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 32
Probabilistic random walk after 69742 steps, saw 27359 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2026-05-25 03:48:33] [INFO ] Invariant cache hit.
[2026-05-25 03:48:33] [INFO ] State equation strengthened by 9982 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2690/2706 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2706 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/2706 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
SMT process timed out in 5078ms, After SMT, problems are : Problem set: 0 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 367 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 2808/2808 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 1060 ms. (37 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 70117 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 32
Probabilistic random walk after 70117 steps, saw 27410 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2026-05-25 03:48:42] [INFO ] Invariant cache hit.
[2026-05-25 03:48:42] [INFO ] State equation strengthened by 9982 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2690/2706 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2706 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2706 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 98/2804 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2804 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 2/2806 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Detected timeout of ITS tools.
[2026-05-25 03:49:20] [INFO ] Flatten gal took : 130 ms
[2026-05-25 03:49:20] [INFO ] Applying decomposition
[2026-05-25 03:49:20] [INFO ] Flatten gal took : 136 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/graph12819897240569252327.txt' '-o' '/tmp/graph12819897240569252327.bin' '-w' '/tmp/graph12819897240569252327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12819897240569252327.bin' '-l' '-1' '-v' '-w' '/tmp/graph12819897240569252327.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:49:21] [INFO ] Decomposing Gal with order
[2026-05-25 03:49:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:49:21] [INFO ] Removed a total of 7676 redundant transitions.
[2026-05-25 03:49:21] [INFO ] Flatten gal took : 606 ms
[2026-05-25 03:49:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 8338 labels/synchronizations in 528 ms.
[2026-05-25 03:49:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12340265032365389252.gal : 57 ms
[2026-05-25 03:49:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4744449938929034468.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12340265032365389252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4744449938929034468.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4744449938929034468.prop.
SDD proceeding with computation,32 properties remain. new max is 4
SDD size :1 after 1562
SDD proceeding with computation,32 properties remain. new max is 8
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 16
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 32
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 64
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 128
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 256
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 512
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 1024
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 2048
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 4096
SDD size :1562 after 1562
SDD proceeding with computation,32 properties remain. new max is 8192
SDD size :1562 after 1562
SMT process timed out in 45357ms, After SMT, problems are : Problem set: 0 solved, 32 unsolved
Fused 32 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 367 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 2808/2808 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Applied a total of 0 rules in 367 ms. Remains 2808 /2808 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2026-05-25 03:49:28] [INFO ] Invariant cache hit.
SDD proceeding with computation,32 properties remain. new max is 16384
SDD size :1562 after 5014
[2026-05-25 03:49:32] [INFO ] Implicit Places using invariants in 3793 ms returned []
Implicit Place search using SMT only with invariants took 3794 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4164 ms. Remains : 2808/2808 places, 10159/10159 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9798 edges and 2808 vertex of which 2589 / 2808 are part of one of the 2 SCC in 15 ms
Free SCC test removed 2587 places
Drop transitions (Empty/Sink Transition effects.) removed 7364 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9906 transitions.
Graph (complete) has 555 edges and 221 vertex of which 70 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 70 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 69 transition count 102
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 21 transition count 54
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 21 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 204 place count 21 transition count 51
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 21 transition count 50
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 207 place count 20 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 19 transition count 48
Applied a total of 208 rules in 55 ms. Remains 19 /2808 variables (removed 2789) and now considering 48/10159 (removed 10111) transitions.
Running SMT prover for 32 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16401789751132486005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1490072206024660125.kers'
[2026-05-25 03:49:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16401789751132486005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1490072206024660125.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 19 cols 81 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-25 03:49:32] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1490072206024660125.kers
Total runtime 0 ms.
[2026-05-25 03:49:32] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:31
TRAPS : Iteration 0
[2026-05-25 03:49:32] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:32
[2026-05-25 03:49:32] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2026-05-25 03:49:32] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
TRAPS : Iteration 0
[2026-05-25 03:49:32] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
[2026-05-25 03:49:32] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
[2026-05-25 03:49:32] [INFO ] Flatten gal took : 1 ms
[2026-05-25 03:49:32] [INFO ] Flatten gal took : 1 ms
[2026-05-25 03:49:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9536989485393099698.gal : 0 ms
[2026-05-25 03:49:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13282757589464145148.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9536989485393099698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13282757589464145148.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13282757589464145148.prop.
SDD proceeding with computation,32 properties remain. new max is 4
SDD size :1 after 11
Invariant property MIN15 does not hold.
Invariant property MIN14 does not hold.
Invariant property MIN9 does not hold.
Invariant property MIN8 does not hold.
Invariant property MIN6 does not hold.
Invariant property MIN5 does not hold.
Invariant property MIN4 does not hold.
Invariant property MIN3 does not hold.
Invariant property MIN2 does not hold.
SDD proceeding with computation,23 properties remain. new max is 4
SDD size :11 after 66
SDD proceeding with computation,23 properties remain. new max is 8
SDD size :66 after 286
SDD proceeding with computation,23 properties remain. new max is 16
SDD size :286 after 1001
SDD proceeding with computation,23 properties remain. new max is 32
SDD size :1001 after 8008
SDD proceeding with computation,23 properties remain. new max is 64
SDD size :8008 after 92378
SDD proceeding with computation,23 properties remain. new max is 128
SDD size :92378 after 3.26876e+06
SDD proceeding with computation,23 properties remain. new max is 256
SDD size :3.26876e+06 after 3.4833e+08
Reachability property MAX15 is true.
Reachability property MAX14 is true.
Invariant property MIN10 does not hold.
Reachability property MAX9 is true.
Reachability property MAX8 is true.
Reachability property MAX6 is true.
Reachability property MAX5 is true.
Reachability property MAX4 is true.
Reachability property MAX3 is true.
Reachability property MAX2 is true.
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :3.4833e+08 after 3.3255e+11
Invariant property MIN13 does not hold.
Reachability property MAX13 is true.
Invariant property MIN12 does not hold.
Reachability property MAX12 is true.
Invariant property MIN11 does not hold.
Reachability property MAX11 is true.
Reachability property MAX10 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3.3255e+11 after 6.48024e+14
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.03189e+15,6.27249,10888,2,1053,47,47192,6,0,111,43996,0
Total reachable state count : 5031886087630586
Verifying 32 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,6.27297,10928,2,20,47,47192,7,0,114,43996,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,9.30527e+13,6.27378,11108,2,674,47,47192,8,0,116,43996,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1,6.27409,11108,2,20,47,47192,9,0,118,43996,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1.11949e+12,6.2746,11108,2,536,47,47192,10,0,120,43996,0
Reachability property MAX2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1,6.27475,11108,2,20,47,47192,11,0,122,43996,0
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,2.59896e+06,6.27501,11108,2,208,47,47192,12,0,124,43996,0
Reachability property MAX3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,1,6.27513,11108,2,20,47,47192,13,0,126,43996,0
Invariant property MIN3 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,48,6.27526,11108,2,20,47,47192,14,0,128,43996,0
Reachability property MAX4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,1,6.27537,11108,2,20,47,47192,15,0,130,43996,0
Invariant property MIN4 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,1176,6.27551,11108,2,67,47,47192,16,0,132,43996,0
Reachability property MAX5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,1,6.27563,11108,2,20,47,47192,17,0,134,43996,0
Invariant property MIN5 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,1,6.27576,11108,2,20,47,47192,18,0,136,43996,0
Reachability property MAX6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX6,1,6.27587,11108,2,20,47,47192,19,0,138,43996,0
Invariant property MIN6 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,2.29575e+07,6.27615,11108,2,255,47,47192,20,0,140,43996,0
Reachability property MAX7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX7,1,6.27628,11108,2,20,47,47192,21,0,142,43996,0
Invariant property MIN7 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,3.66395e+14,6.27691,11108,2,720,47,47192,22,0,144,43996,0
Reachability property MAX8 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX8,1,6.27706,11108,2,20,47,47192,23,0,146,43996,0
Invariant property MIN8 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,249900,6.27727,11108,2,161,47,47192,24,0,148,43996,0
Reachability property MAX9 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX9,1,6.2774,11108,2,20,47,47192,25,0,150,43996,0
Invariant property MIN9 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN9,1.21757e+09,6.27775,11108,2,349,47,47192,26,0,152,43996,0
Reachability property MAX10 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX10,1,6.27788,11108,2,20,47,47192,27,0,154,43996,0
Invariant property MIN10 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN10,4.3183e+10,6.27829,11108,2,443,47,47192,28,0,156,43996,0
Reachability property MAX11 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX11,1,6.27863,11108,2,20,47,47192,29,0,158,43996,0
Invariant property MIN11 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN11,2.27692e+11,6.27912,11108,2,490,47,47192,30,0,160,43996,0
Reachability property MAX12 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX12,1,6.27938,11108,2,20,47,47192,31,0,162,43996,0
Invariant property MIN12 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN12,5.16686e+12,6.27993,11108,2,582,47,47192,32,0,164,43996,0
Reachability property MAX13 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX13,1,6.28015,11108,2,20,47,47192,33,0,166,43996,0
Invariant property MIN13 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN13,2.25128e+13,6.28074,11108,2,628,47,47192,34,0,168,43996,0
Reachability property MAX14 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX14,1,6.28088,11108,2,20,47,47192,35,0,170,43996,0
Invariant property MIN14 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN14,1.77101e+08,6.2812,11108,2,302,47,47192,36,0,172,43996,0
Reachability property MAX15 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX15,1,6.28134,11108,2,20,47,47192,37,0,174,43996,0
Invariant property MIN15 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN15,19600,6.28152,11108,2,114,47,47192,38,0,176,43996,0
Over-approximation ignoring read arcs solved 0 properties in 6773 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17946971168491922390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12742083903781976714.kers'
[2026-05-25 03:49:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17946971168491922390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12742083903781976714.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 03:49:39] [INFO ] Computed 52 invariants in 136 ms
Computed 52 P flows in 137 ms.
Exported basis to /tmp/petrispot-output-12742083903781976714.kers
Total runtime 148 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (44 resets) in 163 ms. (60 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[49]
[2026-05-25 03:49:39] [INFO ] Invariant cache hit.
[2026-05-25 03:49:39] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:49:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:49:42] [INFO ] [Real]Absence check using state equation in 2159 ms returned sat
[2026-05-25 03:49:42] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 03:49:43] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 03:49:43] [INFO ] [Real]Added 9982 Read/Feed constraints in 1388 ms returned sat
[2026-05-25 03:49:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:49:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 03:49:44] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:49:46] [INFO ] [Nat]Absence check using state equation in 2200 ms returned sat
[2026-05-25 03:49:47] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 03:49:47] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1277 ms returned sat
[2026-05-25 03:49:48] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 483 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1515 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1515 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4540373987656022668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6896372938608837674.kers'
[2026-05-25 03:49:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4540373987656022668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6896372938608837674.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 03:49:50] [INFO ] Computed 52 invariants in 136 ms
Computed 52 P flows in 137 ms.
Exported basis to /tmp/petrispot-output-6896372938608837674.kers
Total runtime 145 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 1000000 steps (4345 resets) in 14147 ms. (70 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1345 ms. (742 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 03:50:06] [INFO ] Invariant cache hit.
[2026-05-25 03:50:06] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:50:06] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:50:08] [INFO ] [Real]Absence check using state equation in 2055 ms returned sat
[2026-05-25 03:50:08] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 03:50:09] [INFO ] [Real]Added 10002 Read/Feed constraints in 1156 ms returned sat
[2026-05-25 03:50:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:50:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:50:10] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:50:12] [INFO ] [Nat]Absence check using state equation in 1963 ms returned sat
[2026-05-25 03:50:13] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1280 ms returned sat
[2026-05-25 03:50:14] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 425 ms.
[2026-05-25 03:50:15] [INFO ] Added : 7 causal constraints over 2 iterations in 2109 ms. Result :sat
Minimization took 5074 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 411 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 405 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 03:50:21] [INFO ] Invariant cache hit.
[2026-05-25 03:50:25] [INFO ] Implicit Places using invariants in 3685 ms returned []
Implicit Place search using SMT only with invariants took 3685 ms to find 0 implicit places.
Running 10102 sub problems to find dead transitions.
[2026-05-25 03:50:25] [INFO ] Invariant cache hit.
[2026-05-25 03:50:25] [INFO ] State equation strengthened by 10002 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10102 unsolved
SMT process timed out in 39357ms, After SMT, problems are : Problem set: 0 solved, 10102 unsolved
Search for dead transitions found 0 dead transitions in 39383ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43496 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 03:51:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4355 resets) in 14907 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1328 ms. (752 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 03:51:21] [INFO ] Invariant cache hit.
[2026-05-25 03:51:21] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:51:21] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:51:23] [INFO ] [Real]Absence check using state equation in 2047 ms returned sat
[2026-05-25 03:51:23] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 03:51:24] [INFO ] [Real]Added 10002 Read/Feed constraints in 1192 ms returned sat
[2026-05-25 03:51:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:51:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 03:51:25] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:51:27] [INFO ] [Nat]Absence check using state equation in 2082 ms returned sat
[2026-05-25 03:51:28] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1357 ms returned sat
[2026-05-25 03:51:29] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 498 ms.
[2026-05-25 03:51:31] [INFO ] Added : 7 causal constraints over 2 iterations in 2285 ms. Result :sat
Minimization took 5073 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 523 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 576 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 03:51:37] [INFO ] Invariant cache hit.
[2026-05-25 03:51:41] [INFO ] Implicit Places using invariants in 3620 ms returned []
Implicit Place search using SMT only with invariants took 3621 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4199 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 03:51:41] [INFO ] Flatten gal took : 136 ms
[2026-05-25 03:51:41] [INFO ] Flatten gal took : 141 ms
RANDOM walk for 40000 steps (172 resets) in 1040 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2026-05-25 03:51:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16743278385908846708.gal : 49 ms
[2026-05-25 03:51:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8231611239887034588.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16743278385908846708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8231611239887034588.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8231611239887034588.prop.
Interrupted probabilistic random walk after 80294 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80294 steps, saw 28561 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 03:51:44] [INFO ] Invariant cache hit.
[2026-05-25 03:51:44] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 7091ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 455 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (173 resets) in 1299 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 77576 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 2
Probabilistic random walk after 77576 steps, saw 28252 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2026-05-25 03:51:55] [INFO ] Invariant cache hit.
[2026-05-25 03:51:55] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 03:52:31] [INFO ] Flatten gal took : 127 ms
[2026-05-25 03:52:31] [INFO ] Applying decomposition
[2026-05-25 03:52:31] [INFO ] Flatten gal took : 223 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/graph1759726135032045695.txt' '-o' '/tmp/graph1759726135032045695.bin' '-w' '/tmp/graph1759726135032045695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1759726135032045695.bin' '-l' '-1' '-v' '-w' '/tmp/graph1759726135032045695.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:52:32] [INFO ] Decomposing Gal with order
[2026-05-25 03:52:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:52:32] [INFO ] Removed a total of 7699 redundant transitions.
[2026-05-25 03:52:33] [INFO ] Flatten gal took : 579 ms
[2026-05-25 03:52:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 9656 labels/synchronizations in 559 ms.
[2026-05-25 03:52:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3705607901350462527.gal : 60 ms
[2026-05-25 03:52:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5761756172544064920.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3705607901350462527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5761756172544064920.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5761756172544064920.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 234
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :234 after 234
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :234 after 234
SMT process timed out in 45726ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 486 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 486 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 03:52:42] [INFO ] Invariant cache hit.
[2026-05-25 03:52:45] [INFO ] Implicit Places using invariants in 3578 ms returned []
Implicit Place search using SMT only with invariants took 3579 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4066 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9849 edges and 2802 vertex of which 2598 / 2802 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2596 places
Drop transitions (Empty/Sink Transition effects.) removed 7401 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9943 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 24 ms. Remains 4 /2802 variables (removed 2798) and now considering 5/10152 (removed 10147) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4835795285034369458.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13454820215352207510.kers'
[2026-05-25 03:52:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4835795285034369458.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13454820215352207510.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 03:52:45] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13454820215352207510.kers
Total runtime 0 ms.
[2026-05-25 03:52:45] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 03:52:45] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 03:52:45] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 03:52:45] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 03:52:45] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:52:45] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:52:45] [INFO ] Flatten gal took : 0 ms
[2026-05-25 03:52:45] [INFO ] Flatten gal took : 1 ms
[2026-05-25 03:52:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6897701598262127975.gal : 0 ms
[2026-05-25 03:52:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12257660715010541273.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6897701598262127975.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12257660715010541273.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12257660715010541273.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.009932,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.010219,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.010517,4396,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 96 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-00 in 186687 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5700054732418760979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18233642997910643983.kers'
[2026-05-25 03:52:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5700054732418760979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18233642997910643983.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 03:52:46] [INFO ] Computed 52 invariants in 135 ms
Computed 52 P flows in 135 ms.
Exported basis to /tmp/petrispot-output-18233642997910643983.kers
Total runtime 144 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 171 ms. (58 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 03:52:46] [INFO ] Invariant cache hit.
[2026-05-25 03:52:46] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:52:46] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:52:48] [INFO ] [Real]Absence check using state equation in 2176 ms returned sat
[2026-05-25 03:52:49] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 03:52:50] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 03:52:50] [INFO ] [Real]Added 9982 Read/Feed constraints in 1331 ms returned sat
[2026-05-25 03:52:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:52:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 03:52:50] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:52:53] [INFO ] [Nat]Absence check using state equation in 2187 ms returned sat
[2026-05-25 03:52:54] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 03:52:54] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1443 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1564 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1564 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5670132736860438646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9617339591113284645.kers'
[2026-05-25 03:52:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5670132736860438646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9617339591113284645.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 03:52:56] [INFO ] Computed 52 invariants in 133 ms
Computed 52 P flows in 133 ms.
Exported basis to /tmp/petrispot-output-9617339591113284645.kers
Total runtime 139 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4351 resets) in 15210 ms. (65 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1368 ms. (730 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 03:53:12] [INFO ] Invariant cache hit.
[2026-05-25 03:53:13] [INFO ] [Real]Absence check using 50 positive place invariants in 37 ms returned sat
[2026-05-25 03:53:13] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:53:15] [INFO ] [Real]Absence check using state equation in 1983 ms returned sat
[2026-05-25 03:53:15] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 03:53:16] [INFO ] [Real]Added 10002 Read/Feed constraints in 1101 ms returned sat
[2026-05-25 03:53:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:53:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:53:16] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:53:18] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2026-05-25 03:53:20] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1397 ms returned sat
[2026-05-25 03:53:20] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 427 ms.
[2026-05-25 03:53:22] [INFO ] Added : 7 causal constraints over 2 iterations in 2202 ms. Result :sat
Minimization took 5077 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 485 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 477 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 03:53:28] [INFO ] Invariant cache hit.
[2026-05-25 03:53:32] [INFO ] Implicit Places using invariants in 3387 ms returned []
Implicit Place search using SMT only with invariants took 3388 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3866 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 03:53:32] [INFO ] Flatten gal took : 147 ms
RANDOM walk for 40000 steps (172 resets) in 1084 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
[2026-05-25 03:53:32] [INFO ] Flatten gal took : 219 ms
[2026-05-25 03:53:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8374049790685614511.gal : 30 ms
[2026-05-25 03:53:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9997772984065084246.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8374049790685614511.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9997772984065084246.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9997772984065084246.prop.
Interrupted probabilistic random walk after 80986 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80986 steps, saw 28629 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 03:53:35] [INFO ] Invariant cache hit.
[2026-05-25 03:53:35] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6821ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 538 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (173 resets) in 830 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 80959 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80959 steps, saw 28626 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 03:53:46] [INFO ] Invariant cache hit.
[2026-05-25 03:53:46] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 03:54:22] [INFO ] Flatten gal took : 122 ms
[2026-05-25 03:54:22] [INFO ] Applying decomposition
[2026-05-25 03:54:22] [INFO ] Flatten gal took : 148 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/graph7809151736310173604.txt' '-o' '/tmp/graph7809151736310173604.bin' '-w' '/tmp/graph7809151736310173604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7809151736310173604.bin' '-l' '-1' '-v' '-w' '/tmp/graph7809151736310173604.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:54:23] [INFO ] Decomposing Gal with order
[2026-05-25 03:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:54:23] [INFO ] Removed a total of 7699 redundant transitions.
[2026-05-25 03:54:24] [INFO ] Flatten gal took : 574 ms
[2026-05-25 03:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 9656 labels/synchronizations in 502 ms.
[2026-05-25 03:54:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2504644982309061327.gal : 58 ms
[2026-05-25 03:54:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5786139828706466069.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2504644982309061327.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5786139828706466069.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5786139828706466069.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 180
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :180 after 180
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :180 after 180
SMT process timed out in 47091ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 481 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 482 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 482 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 03:54:34] [INFO ] Invariant cache hit.
[2026-05-25 03:54:37] [INFO ] Implicit Places using invariants in 3534 ms returned []
Implicit Place search using SMT only with invariants took 3536 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4020 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9849 edges and 2802 vertex of which 2598 / 2802 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2596 places
Drop transitions (Empty/Sink Transition effects.) removed 7401 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9943 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 19 ms. Remains 4 /2802 variables (removed 2798) and now considering 5/10152 (removed 10147) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16450671410543953098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1092375133897961238.kers'
[2026-05-25 03:54:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16450671410543953098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1092375133897961238.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 03:54:37] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1092375133897961238.kers
Total runtime 0 ms.
[2026-05-25 03:54:37] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 03:54:37] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 03:54:37] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 03:54:37] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 03:54:37] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:54:37] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:54:37] [INFO ] Flatten gal took : 1 ms
[2026-05-25 03:54:37] [INFO ] Flatten gal took : 0 ms
[2026-05-25 03:54:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4105871175386463860.gal : 1 ms
[2026-05-25 03:54:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17156980513604787678.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4105871175386463860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17156980513604787678.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17156980513604787678.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.009251,4188,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009624,4324,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.009897,4412,2,5,12,685,8,0,27,660,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 101 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-01 in 111983 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13304121815642036444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7402062390842174687.kers'
[2026-05-25 03:54:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13304121815642036444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7402062390842174687.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 03:54:38] [INFO ] Computed 52 invariants in 129 ms
Computed 52 P flows in 129 ms.
Exported basis to /tmp/petrispot-output-7402062390842174687.kers
Total runtime 138 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 168 ms. (59 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 03:54:38] [INFO ] Invariant cache hit.
[2026-05-25 03:54:38] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:54:38] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:54:40] [INFO ] [Real]Absence check using state equation in 2056 ms returned sat
[2026-05-25 03:54:40] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 03:54:41] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 03:54:42] [INFO ] [Real]Added 9982 Read/Feed constraints in 1500 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 2803 transition count 10154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 2803 transition count 10153
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 2803 transition count 10153
Applied a total of 21 rules in 1819 ms. Remains 2803 /2808 variables (removed 5) and now considering 10153/10159 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1820 ms. Remains : 2803/2808 places, 10153/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16559234649769024422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16568020620973983731.kers'
[2026-05-25 03:54:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16559234649769024422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16568020620973983731.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10153 rows 2803 cols 20754 entries
Finished phase 1 with 2701 SingleSign rule and 50 generalized
[2026-05-25 03:54:44] [INFO ] Computed 52 invariants in 134 ms
Computed 52 P flows in 135 ms.
Exported basis to /tmp/petrispot-output-16568020620973983731.kers
Total runtime 144 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4352 resets) in 16954 ms. (58 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1468 ms. (680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 03:55:03] [INFO ] Invariant cache hit.
[2026-05-25 03:55:03] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:55:03] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:55:05] [INFO ] [Real]Absence check using state equation in 2169 ms returned sat
[2026-05-25 03:55:05] [INFO ] State equation strengthened by 10001 read => feed constraints.
[2026-05-25 03:55:07] [INFO ] [Real]Added 10001 Read/Feed constraints in 1324 ms returned sat
[2026-05-25 03:55:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:55:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 03:55:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:55:09] [INFO ] [Nat]Absence check using state equation in 2216 ms returned sat
[2026-05-25 03:55:11] [INFO ] [Nat]Added 10001 Read/Feed constraints in 1918 ms returned sat
[2026-05-25 03:55:12] [INFO ] Computed and/alt/rep : 7359/19569/7359 causal constraints (skipped 2744 transitions) in 518 ms.
[2026-05-25 03:55:14] [INFO ] Added : 12 causal constraints over 3 iterations in 2980 ms. Result :sat
Minimization took 5062 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 469 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 480 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 03:55:20] [INFO ] Invariant cache hit.
[2026-05-25 03:55:24] [INFO ] Implicit Places using invariants in 3549 ms returned []
Implicit Place search using SMT only with invariants took 3550 ms to find 0 implicit places.
Running 10103 sub problems to find dead transitions.
[2026-05-25 03:55:24] [INFO ] Invariant cache hit.
[2026-05-25 03:55:24] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10103 unsolved
SMT process timed out in 39653ms, After SMT, problems are : Problem set: 0 solved, 10103 unsolved
Search for dead transitions found 0 dead transitions in 39673ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43722 ms. Remains : 2803/2803 places, 10153/10153 transitions.
[2026-05-25 03:56:04] [INFO ] Flatten gal took : 254 ms
RANDOM walk for 40000 steps (172 resets) in 828 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2026-05-25 03:56:04] [INFO ] Flatten gal took : 145 ms
[2026-05-25 03:56:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17079459825915056408.gal : 32 ms
[2026-05-25 03:56:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4502791173880929500.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17079459825915056408.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4502791173880929500.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4502791173880929500.prop.
Interrupted probabilistic random walk after 80226 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80226 steps, saw 28556 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 03:56:07] [INFO ] Invariant cache hit.
[2026-05-25 03:56:07] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6879ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 466 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 467 ms. Remains : 2803/2803 places, 10153/10153 transitions.
RANDOM walk for 40000 steps (173 resets) in 863 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 82649 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82649 steps, saw 28815 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 03:56:18] [INFO ] Invariant cache hit.
[2026-05-25 03:56:18] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 03:56:54] [INFO ] Flatten gal took : 135 ms
[2026-05-25 03:56:54] [INFO ] Applying decomposition
[2026-05-25 03:56:55] [INFO ] Flatten gal took : 150 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/graph15260340213409056121.txt' '-o' '/tmp/graph15260340213409056121.bin' '-w' '/tmp/graph15260340213409056121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15260340213409056121.bin' '-l' '-1' '-v' '-w' '/tmp/graph15260340213409056121.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:56:55] [INFO ] Decomposing Gal with order
[2026-05-25 03:56:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:56:56] [INFO ] Removed a total of 7698 redundant transitions.
[2026-05-25 03:56:56] [INFO ] Flatten gal took : 612 ms
[2026-05-25 03:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 9658 labels/synchronizations in 495 ms.
[2026-05-25 03:56:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12213269925910135360.gal : 56 ms
[2026-05-25 03:56:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality739390331260317119.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12213269925910135360.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality739390331260317119.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality739390331260317119.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 98
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :98 after 98
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :98 after 98
SMT process timed out in 46729ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 467 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 575 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 03:57:06] [INFO ] Invariant cache hit.
[2026-05-25 03:57:09] [INFO ] Implicit Places using invariants in 3695 ms returned []
Implicit Place search using SMT only with invariants took 3711 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4288 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9850 edges and 2803 vertex of which 2599 / 2803 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2597 places
Drop transitions (Empty/Sink Transition effects.) removed 7402 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9944 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 17 ms. Remains 4 /2803 variables (removed 2799) and now considering 5/10153 (removed 10148) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11259027417905617299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2099450684663923938.kers'
[2026-05-25 03:57:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11259027417905617299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2099450684663923938.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 03:57:09] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-2099450684663923938.kers
Total runtime 14 ms.
[2026-05-25 03:57:09] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 03:57:09] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 03:57:09] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 03:57:09] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 03:57:09] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:57:09] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 03:57:09] [INFO ] Flatten gal took : 0 ms
[2026-05-25 03:57:09] [INFO ] Flatten gal took : 0 ms
[2026-05-25 03:57:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2075358340000254583.gal : 0 ms
[2026-05-25 03:57:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2117994621399424512.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2075358340000254583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2117994621399424512.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2117994621399424512.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.009071,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009421,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.009663,4396,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 127 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-02 in 151966 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17299256765641721299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15860576292669859996.kers'
[2026-05-25 03:57:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17299256765641721299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15860576292669859996.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 03:57:10] [INFO ] Computed 52 invariants in 133 ms
Computed 52 P flows in 134 ms.
Exported basis to /tmp/petrispot-output-15860576292669859996.kers
Total runtime 142 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 146 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 03:57:10] [INFO ] Invariant cache hit.
[2026-05-25 03:57:10] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 03:57:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:57:12] [INFO ] [Real]Absence check using state equation in 2074 ms returned sat
[2026-05-25 03:57:12] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 03:57:13] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 03:57:14] [INFO ] [Real]Added 9982 Read/Feed constraints in 1313 ms returned sat
[2026-05-25 03:57:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:57:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 03:57:14] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 7 ms returned sat
[2026-05-25 03:57:16] [INFO ] [Nat]Absence check using state equation in 2176 ms returned sat
[2026-05-25 03:57:17] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 03:57:18] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1443 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1707 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1707 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9102647296728900438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2432096389098932529.kers'
[2026-05-25 03:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9102647296728900438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2432096389098932529.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 03:57:20] [INFO ] Computed 52 invariants in 136 ms
Computed 52 P flows in 136 ms.
Exported basis to /tmp/petrispot-output-2432096389098932529.kers
Total runtime 150 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4357 resets) in 14686 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1364 ms. (732 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 03:57:36] [INFO ] Invariant cache hit.
[2026-05-25 03:57:36] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 03:57:36] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 03:57:38] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2026-05-25 03:57:38] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 03:57:39] [INFO ] [Real]Added 10002 Read/Feed constraints in 1082 ms returned sat
[2026-05-25 03:57:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 03:57:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 03:57:40] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 03:57:42] [INFO ] [Nat]Absence check using state equation in 2016 ms returned sat
[2026-05-25 03:57:43] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1334 ms returned sat
[2026-05-25 03:57:44] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 444 ms.
[2026-05-25 03:57:46] [INFO ] Added : 7 causal constraints over 2 iterations in 2237 ms. Result :sat
Minimization took 5107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 468 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 455 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 03:57:52] [INFO ] Invariant cache hit.
[2026-05-25 03:57:55] [INFO ] Implicit Places using invariants in 3433 ms returned []
Implicit Place search using SMT only with invariants took 3433 ms to find 0 implicit places.
Running 10102 sub problems to find dead transitions.
[2026-05-25 03:57:55] [INFO ] Invariant cache hit.
[2026-05-25 03:57:55] [INFO ] State equation strengthened by 10002 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10102 unsolved
SMT process timed out in 39558ms, After SMT, problems are : Problem set: 0 solved, 10102 unsolved
Search for dead transitions found 0 dead transitions in 39576ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43483 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 03:58:35] [INFO ] Flatten gal took : 273 ms
RANDOM walk for 40000 steps (172 resets) in 1249 ms. (32 steps per ms) remains 2/2 properties
[2026-05-25 03:58:35] [INFO ] Flatten gal took : 162 ms
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2026-05-25 03:58:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2462291795452441416.gal : 32 ms
[2026-05-25 03:58:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9549828016550130906.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2462291795452441416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9549828016550130906.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9549828016550130906.prop.
Interrupted probabilistic random walk after 81971 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81971 steps, saw 28723 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 03:58:38] [INFO ] Invariant cache hit.
[2026-05-25 03:58:38] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6902ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 455 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (172 resets) in 1084 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 524 ms. (76 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 80541 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80541 steps, saw 28584 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 03:58:49] [INFO ] Invariant cache hit.
[2026-05-25 03:58:49] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 03:59:25] [INFO ] Flatten gal took : 167 ms
[2026-05-25 03:59:25] [INFO ] Applying decomposition
[2026-05-25 03:59:26] [INFO ] Flatten gal took : 153 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/graph10189830659861677887.txt' '-o' '/tmp/graph10189830659861677887.bin' '-w' '/tmp/graph10189830659861677887.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10189830659861677887.bin' '-l' '-1' '-v' '-w' '/tmp/graph10189830659861677887.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:59:26] [INFO ] Decomposing Gal with order
[2026-05-25 03:59:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:59:27] [INFO ] Removed a total of 7699 redundant transitions.
[2026-05-25 03:59:27] [INFO ] Flatten gal took : 636 ms
[2026-05-25 03:59:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 9656 labels/synchronizations in 538 ms.
[2026-05-25 03:59:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18142943667543156519.gal : 69 ms
[2026-05-25 03:59:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality682402445169006047.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18142943667543156519.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality682402445169006047.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality682402445169006047.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4990
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4990 after 4990
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4990 after 5111
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2800/12954 variables, and 69 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/2802 constraints, ReadFeed: 0/10002 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2800 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5111 after 1.42002e+06
Detected timeout of ITS tools.
SMT process timed out in 91461ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 464 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 476 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:00:21] [INFO ] Invariant cache hit.
[2026-05-25 04:00:25] [INFO ] Implicit Places using invariants in 3625 ms returned []
Implicit Place search using SMT only with invariants took 3625 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4102 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-03 in 195596 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13758032666515327775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2465463257339967982.kers'
[2026-05-25 04:00:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13758032666515327775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2465463257339967982.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:00:25] [INFO ] Computed 52 invariants in 138 ms
Computed 52 P flows in 139 ms.
Exported basis to /tmp/petrispot-output-2465463257339967982.kers
Total runtime 147 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (44 resets) in 141 ms. (70 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:00:25] [INFO ] Invariant cache hit.
[2026-05-25 04:00:26] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:00:26] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:00:28] [INFO ] [Real]Absence check using state equation in 2159 ms returned sat
[2026-05-25 04:00:28] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:00:29] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:00:29] [INFO ] [Real]Added 9982 Read/Feed constraints in 1386 ms returned sat
[2026-05-25 04:00:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:00:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 04:00:30] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:00:32] [INFO ] [Nat]Absence check using state equation in 2375 ms returned sat
[2026-05-25 04:00:33] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:00:34] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1501 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1745 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1745 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2366672579652615665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7890937636669540759.kers'
[2026-05-25 04:00:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2366672579652615665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7890937636669540759.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 04:00:36] [INFO ] Computed 52 invariants in 143 ms
Computed 52 P flows in 144 ms.
Exported basis to /tmp/petrispot-output-7890937636669540759.kers
Total runtime 156 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4354 resets) in 14638 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1393 ms. (717 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:00:52] [INFO ] Invariant cache hit.
[2026-05-25 04:00:52] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:00:52] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 04:00:54] [INFO ] [Real]Absence check using state equation in 2030 ms returned sat
[2026-05-25 04:00:54] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:00:56] [INFO ] [Real]Added 10002 Read/Feed constraints in 1193 ms returned sat
[2026-05-25 04:00:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:00:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 04:00:56] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:00:58] [INFO ] [Nat]Absence check using state equation in 2033 ms returned sat
[2026-05-25 04:00:59] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1322 ms returned sat
[2026-05-25 04:01:00] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 433 ms.
[2026-05-25 04:01:02] [INFO ] Added : 7 causal constraints over 2 iterations in 2150 ms. Result :sat
Minimization took 5078 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 475 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 477 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:01:08] [INFO ] Invariant cache hit.
[2026-05-25 04:01:11] [INFO ] Implicit Places using invariants in 3588 ms returned []
Implicit Place search using SMT only with invariants took 3588 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4067 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 04:01:12] [INFO ] Flatten gal took : 134 ms
RANDOM walk for 40000 steps (172 resets) in 841 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
[2026-05-25 04:01:12] [INFO ] Flatten gal took : 138 ms
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
[2026-05-25 04:01:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18194590627126074449.gal : 33 ms
[2026-05-25 04:01:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14721052629310961967.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18194590627126074449.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14721052629310961967.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14721052629310961967.prop.
Interrupted probabilistic random walk after 79018 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 79018 steps, saw 28430 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:01:15] [INFO ] Invariant cache hit.
[2026-05-25 04:01:15] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 7287ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 468 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (172 resets) in 818 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 80995 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80995 steps, saw 28629 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:01:26] [INFO ] Invariant cache hit.
[2026-05-25 04:01:26] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:02:02] [INFO ] Flatten gal took : 125 ms
[2026-05-25 04:02:02] [INFO ] Applying decomposition
[2026-05-25 04:02:02] [INFO ] Flatten gal took : 127 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/graph2139736907181673300.txt' '-o' '/tmp/graph2139736907181673300.bin' '-w' '/tmp/graph2139736907181673300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2139736907181673300.bin' '-l' '-1' '-v' '-w' '/tmp/graph2139736907181673300.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:02:02] [INFO ] Decomposing Gal with order
[2026-05-25 04:02:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:02:03] [INFO ] Removed a total of 7699 redundant transitions.
[2026-05-25 04:02:03] [INFO ] Flatten gal took : 558 ms
[2026-05-25 04:02:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 9656 labels/synchronizations in 496 ms.
[2026-05-25 04:02:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8118690356978376525.gal : 56 ms
[2026-05-25 04:02:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8278422663961941438.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8118690356978376525.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8278422663961941438.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8278422663961941438.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 197
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :197 after 197
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :197 after 239
SMT process timed out in 46947ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 479 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 486 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:02:14] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :239 after 30750
[2026-05-25 04:02:17] [INFO ] Implicit Places using invariants in 3523 ms returned []
Implicit Place search using SMT only with invariants took 3523 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4010 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9849 edges and 2802 vertex of which 2598 / 2802 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2596 places
Drop transitions (Empty/Sink Transition effects.) removed 7401 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9943 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 17 ms. Remains 4 /2802 variables (removed 2798) and now considering 5/10152 (removed 10147) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4136668882506237077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9012646565468688857.kers'
[2026-05-25 04:02:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4136668882506237077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9012646565468688857.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:02:17] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9012646565468688857.kers
Total runtime 0 ms.
[2026-05-25 04:02:17] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:02:17] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:02:17] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:02:17] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:02:17] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:02:17] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:02:17] [INFO ] Flatten gal took : 1 ms
[2026-05-25 04:02:17] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:02:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15389796437335243369.gal : 0 ms
[2026-05-25 04:02:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10064839975816414525.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15389796437335243369.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10064839975816414525.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10064839975816414525.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.00872,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009046,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.009231,4404,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 83 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-04 in 112242 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5600563301614859791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12050511268541772801.kers'
[2026-05-25 04:02:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5600563301614859791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12050511268541772801.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:02:17] [INFO ] Computed 52 invariants in 137 ms
Computed 52 P flows in 137 ms.
Exported basis to /tmp/petrispot-output-12050511268541772801.kers
Total runtime 145 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 159 ms. (62 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[49]
[2026-05-25 04:02:18] [INFO ] Invariant cache hit.
[2026-05-25 04:02:18] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 04:02:18] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:02:20] [INFO ] [Real]Absence check using state equation in 1951 ms returned sat
[2026-05-25 04:02:20] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:02:21] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:02:21] [INFO ] [Real]Added 9982 Read/Feed constraints in 1429 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
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 0 with 10 rules applied. Total rules applied 10 place count 2803 transition count 10154
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2803 transition count 10154
Applied a total of 20 rules in 1245 ms. Remains 2803 /2808 variables (removed 5) and now considering 10154/10159 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1245 ms. Remains : 2803/2808 places, 10154/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-45396113993867959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14425748194098306390.kers'
[2026-05-25 04:02:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-45396113993867959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14425748194098306390.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10154 rows 2803 cols 20756 entries
Finished phase 1 with 2701 SingleSign rule and 50 generalized
[2026-05-25 04:02:23] [INFO ] Computed 52 invariants in 138 ms
Computed 52 P flows in 138 ms.
Exported basis to /tmp/petrispot-output-14425748194098306390.kers
Total runtime 153 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 1000000 steps (4359 resets) in 16053 ms. (62 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1314 ms. (760 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:02:40] [INFO ] Invariant cache hit.
[2026-05-25 04:02:41] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 04:02:41] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:02:43] [INFO ] [Real]Absence check using state equation in 1963 ms returned sat
[2026-05-25 04:02:43] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:02:44] [INFO ] [Real]Added 10002 Read/Feed constraints in 1333 ms returned sat
[2026-05-25 04:02:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:02:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:02:45] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:02:47] [INFO ] [Nat]Absence check using state equation in 2021 ms returned sat
[2026-05-25 04:02:49] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1777 ms returned sat
[2026-05-25 04:02:49] [INFO ] Computed and/alt/rep : 7360/19572/7360 causal constraints (skipped 2744 transitions) in 431 ms.
[2026-05-25 04:02:51] [INFO ] Added : 12 causal constraints over 3 iterations in 2575 ms. Result :sat
Minimization took 5055 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10154/10154 transitions.
Applied a total of 0 rules in 473 ms. Remains 2803 /2803 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 2803/2803 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10154/10154 transitions.
Applied a total of 0 rules in 463 ms. Remains 2803 /2803 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2026-05-25 04:02:57] [INFO ] Invariant cache hit.
[2026-05-25 04:03:01] [INFO ] Implicit Places using invariants in 3415 ms returned []
Implicit Place search using SMT only with invariants took 3415 ms to find 0 implicit places.
Running 10104 sub problems to find dead transitions.
[2026-05-25 04:03:01] [INFO ] Invariant cache hit.
[2026-05-25 04:03:01] [INFO ] State equation strengthened by 10002 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10104 unsolved
SMT process timed out in 39383ms, After SMT, problems are : Problem set: 0 solved, 10104 unsolved
Search for dead transitions found 0 dead transitions in 39401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43303 ms. Remains : 2803/2803 places, 10154/10154 transitions.
[2026-05-25 04:03:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4357 resets) in 14537 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1373 ms. (727 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:03:56] [INFO ] Invariant cache hit.
[2026-05-25 04:03:56] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:03:56] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:03:58] [INFO ] [Real]Absence check using state equation in 1971 ms returned sat
[2026-05-25 04:03:59] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:04:00] [INFO ] [Real]Added 10002 Read/Feed constraints in 1338 ms returned sat
[2026-05-25 04:04:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:04:00] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 04:04:00] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:04:02] [INFO ] [Nat]Absence check using state equation in 1994 ms returned sat
[2026-05-25 04:04:04] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1819 ms returned sat
[2026-05-25 04:04:05] [INFO ] Computed and/alt/rep : 7360/19572/7360 causal constraints (skipped 2744 transitions) in 434 ms.
[2026-05-25 04:04:07] [INFO ] Added : 12 causal constraints over 3 iterations in 2548 ms. Result :sat
Minimization took 5059 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10154/10154 transitions.
Applied a total of 0 rules in 481 ms. Remains 2803 /2803 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 2803/2803 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10154/10154 transitions.
Applied a total of 0 rules in 464 ms. Remains 2803 /2803 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2026-05-25 04:04:13] [INFO ] Invariant cache hit.
[2026-05-25 04:04:16] [INFO ] Implicit Places using invariants in 3458 ms returned []
Implicit Place search using SMT only with invariants took 3458 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3924 ms. Remains : 2803/2803 places, 10154/10154 transitions.
[2026-05-25 04:04:17] [INFO ] Flatten gal took : 192 ms
RANDOM walk for 40000 steps (171 resets) in 931 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
[2026-05-25 04:04:17] [INFO ] Flatten gal took : 131 ms
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
[2026-05-25 04:04:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2037130382322629335.gal : 31 ms
[2026-05-25 04:04:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1208656777669298312.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2037130382322629335.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1208656777669298312.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1208656777669298312.prop.
Interrupted probabilistic random walk after 78925 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 78925 steps, saw 28420 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:04:20] [INFO ] Invariant cache hit.
[2026-05-25 04:04:20] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6712ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10154/10154 transitions.
Applied a total of 0 rules in 470 ms. Remains 2803 /2803 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 2803/2803 places, 10154/10154 transitions.
RANDOM walk for 40000 steps (171 resets) in 1023 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 82011 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82011 steps, saw 28726 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:04:30] [INFO ] Invariant cache hit.
[2026-05-25 04:04:30] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:05:07] [INFO ] Flatten gal took : 196 ms
[2026-05-25 04:05:07] [INFO ] Applying decomposition
[2026-05-25 04:05:07] [INFO ] Flatten gal took : 115 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/graph4026784743659277627.txt' '-o' '/tmp/graph4026784743659277627.bin' '-w' '/tmp/graph4026784743659277627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4026784743659277627.bin' '-l' '-1' '-v' '-w' '/tmp/graph4026784743659277627.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:05:07] [INFO ] Decomposing Gal with order
[2026-05-25 04:05:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:05:08] [INFO ] Removed a total of 7701 redundant transitions.
[2026-05-25 04:05:08] [INFO ] Flatten gal took : 553 ms
[2026-05-25 04:05:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 9752 labels/synchronizations in 485 ms.
[2026-05-25 04:05:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3759363469715465836.gal : 54 ms
[2026-05-25 04:05:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12855693686895473090.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3759363469715465836.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12855693686895473090.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12855693686895473090.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 174
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :174 after 174
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :174 after 22147
SMT process timed out in 46093ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10154/10154 transitions.
Applied a total of 0 rules in 461 ms. Remains 2803 /2803 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 461 ms. Remains : 2803/2803 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10154/10154 transitions.
Applied a total of 0 rules in 456 ms. Remains 2803 /2803 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2026-05-25 04:05:17] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :22147 after 38410
[2026-05-25 04:05:21] [INFO ] Implicit Places using invariants in 3665 ms returned []
Implicit Place search using SMT only with invariants took 3676 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4135 ms. Remains : 2803/2803 places, 10154/10154 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9851 edges and 2803 vertex of which 2599 / 2803 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2597 places
Drop transitions (Empty/Sink Transition effects.) removed 7403 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9945 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 18 ms. Remains 4 /2803 variables (removed 2799) and now considering 5/10154 (removed 10149) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1512335463485561477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15907069566472482471.kers'
[2026-05-25 04:05:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1512335463485561477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15907069566472482471.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:05:21] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15907069566472482471.kers
Total runtime 0 ms.
[2026-05-25 04:05:21] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:05:21] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:05:21] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:05:21] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:05:21] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:05:21] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:05:21] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:05:21] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:05:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9203488310411229254.gal : 0 ms
[2026-05-25 04:05:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9024231245277134556.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9203488310411229254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9024231245277134556.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9024231245277134556.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.01474,4188,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.015016,4324,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.015191,4412,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 147 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-05 in 183897 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5074696632159095162.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2149929441480084279.kers'
[2026-05-25 04:05:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5074696632159095162.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2149929441480084279.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:05:21] [INFO ] Computed 52 invariants in 137 ms
Computed 52 P flows in 137 ms.
Exported basis to /tmp/petrispot-output-2149929441480084279.kers
Total runtime 146 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 140 ms. (70 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[49]
[2026-05-25 04:05:21] [INFO ] Invariant cache hit.
[2026-05-25 04:05:22] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:05:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:05:24] [INFO ] [Real]Absence check using state equation in 1906 ms returned sat
[2026-05-25 04:05:24] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:05:25] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:05:25] [INFO ] [Real]Added 9982 Read/Feed constraints in 1261 ms returned sat
[2026-05-25 04:05:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:05:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:05:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:05:28] [INFO ] [Nat]Absence check using state equation in 1943 ms returned sat
[2026-05-25 04:05:28] [INFO ] [Nat]Added 9982 Read/Feed constraints in 933 ms returned sat
[2026-05-25 04:05:29] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 429 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 2803 transition count 10154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 2803 transition count 10153
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 2803 transition count 10153
Applied a total of 21 rules in 1815 ms. Remains 2803 /2808 variables (removed 5) and now considering 10153/10159 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1815 ms. Remains : 2803/2808 places, 10153/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8168823506176018024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12118152538315937367.kers'
[2026-05-25 04:05:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8168823506176018024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12118152538315937367.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10153 rows 2803 cols 20754 entries
Finished phase 1 with 2701 SingleSign rule and 50 generalized
[2026-05-25 04:05:32] [INFO ] Computed 52 invariants in 133 ms
Computed 52 P flows in 133 ms.
Exported basis to /tmp/petrispot-output-12118152538315937367.kers
Total runtime 148 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 1000000 steps (4362 resets) in 14363 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (71 resets) in 1313 ms. (761 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:05:48] [INFO ] Invariant cache hit.
[2026-05-25 04:05:48] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:05:48] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:05:50] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2026-05-25 04:05:51] [INFO ] State equation strengthened by 10001 read => feed constraints.
[2026-05-25 04:05:52] [INFO ] [Real]Added 10001 Read/Feed constraints in 1113 ms returned sat
[2026-05-25 04:05:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:05:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 04:05:52] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 04:05:54] [INFO ] [Nat]Absence check using state equation in 2045 ms returned sat
[2026-05-25 04:05:56] [INFO ] [Nat]Added 10001 Read/Feed constraints in 1690 ms returned sat
[2026-05-25 04:05:56] [INFO ] Computed and/alt/rep : 7359/19569/7359 causal constraints (skipped 2744 transitions) in 428 ms.
[2026-05-25 04:05:58] [INFO ] Added : 9 causal constraints over 2 iterations in 2161 ms. Result :sat
Minimization took 5082 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 487 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 479 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:06:04] [INFO ] Invariant cache hit.
[2026-05-25 04:06:08] [INFO ] Implicit Places using invariants in 3554 ms returned []
Implicit Place search using SMT only with invariants took 3556 ms to find 0 implicit places.
Running 10103 sub problems to find dead transitions.
[2026-05-25 04:06:08] [INFO ] Invariant cache hit.
[2026-05-25 04:06:08] [INFO ] State equation strengthened by 10001 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10103 unsolved
SMT process timed out in 39246ms, After SMT, problems are : Problem set: 0 solved, 10103 unsolved
Search for dead transitions found 0 dead transitions in 39266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43322 ms. Remains : 2803/2803 places, 10153/10153 transitions.
[2026-05-25 04:06:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4356 resets) in 14248 ms. (70 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1257 ms. (794 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:07:03] [INFO ] Invariant cache hit.
[2026-05-25 04:07:03] [INFO ] [Real]Absence check using 50 positive place invariants in 36 ms returned sat
[2026-05-25 04:07:03] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:07:05] [INFO ] [Real]Absence check using state equation in 1932 ms returned sat
[2026-05-25 04:07:05] [INFO ] State equation strengthened by 10001 read => feed constraints.
[2026-05-25 04:07:06] [INFO ] [Real]Added 10001 Read/Feed constraints in 1050 ms returned sat
[2026-05-25 04:07:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:07:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:07:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:07:09] [INFO ] [Nat]Absence check using state equation in 1978 ms returned sat
[2026-05-25 04:07:10] [INFO ] [Nat]Added 10001 Read/Feed constraints in 1624 ms returned sat
[2026-05-25 04:07:11] [INFO ] Computed and/alt/rep : 7359/19569/7359 causal constraints (skipped 2744 transitions) in 438 ms.
[2026-05-25 04:07:13] [INFO ] Added : 9 causal constraints over 2 iterations in 2174 ms. Result :sat
Minimization took 5068 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 474 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 464 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:07:19] [INFO ] Invariant cache hit.
[2026-05-25 04:07:22] [INFO ] Implicit Places using invariants in 3411 ms returned []
Implicit Place search using SMT only with invariants took 3411 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3878 ms. Remains : 2803/2803 places, 10153/10153 transitions.
[2026-05-25 04:07:22] [INFO ] Flatten gal took : 188 ms
RANDOM walk for 40000 steps (173 resets) in 738 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2026-05-25 04:07:22] [INFO ] Flatten gal took : 141 ms
[2026-05-25 04:07:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5062152906000262757.gal : 30 ms
[2026-05-25 04:07:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13115602463354234440.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5062152906000262757.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13115602463354234440.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13115602463354234440.prop.
Interrupted probabilistic random walk after 80234 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80234 steps, saw 28557 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:07:25] [INFO ] Invariant cache hit.
[2026-05-25 04:07:25] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6812ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 454 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 2803/2803 places, 10153/10153 transitions.
RANDOM walk for 40000 steps (172 resets) in 1108 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 81685 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81685 steps, saw 28696 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:07:36] [INFO ] Invariant cache hit.
[2026-05-25 04:07:36] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:08:13] [INFO ] Flatten gal took : 117 ms
[2026-05-25 04:08:13] [INFO ] Applying decomposition
[2026-05-25 04:08:13] [INFO ] Flatten gal took : 118 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/graph10183316885941105111.txt' '-o' '/tmp/graph10183316885941105111.bin' '-w' '/tmp/graph10183316885941105111.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10183316885941105111.bin' '-l' '-1' '-v' '-w' '/tmp/graph10183316885941105111.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:08:13] [INFO ] Decomposing Gal with order
[2026-05-25 04:08:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:08:14] [INFO ] Removed a total of 7698 redundant transitions.
[2026-05-25 04:08:14] [INFO ] Flatten gal took : 530 ms
[2026-05-25 04:08:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 9658 labels/synchronizations in 482 ms.
[2026-05-25 04:08:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17766755155208325595.gal : 54 ms
[2026-05-25 04:08:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10069667161999254741.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17766755155208325595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10069667161999254741.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10069667161999254741.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 195
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :195 after 195
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :195 after 195
SMT process timed out in 46050ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 550 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 460 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:08:23] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :195 after 27104
[2026-05-25 04:08:26] [INFO ] Implicit Places using invariants in 3402 ms returned []
Implicit Place search using SMT only with invariants took 3402 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3864 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9850 edges and 2803 vertex of which 2599 / 2803 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2597 places
Drop transitions (Empty/Sink Transition effects.) removed 7402 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9944 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 16 ms. Remains 4 /2803 variables (removed 2799) and now considering 5/10153 (removed 10148) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16769132134116072390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9674356940050365304.kers'
[2026-05-25 04:08:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16769132134116072390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9674356940050365304.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:08:26] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9674356940050365304.kers
Total runtime 0 ms.
[2026-05-25 04:08:26] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:08:26] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:08:26] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:08:26] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:08:26] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:08:26] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:08:26] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:08:26] [INFO ] Flatten gal took : 1 ms
[2026-05-25 04:08:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9808970082147681301.gal : 0 ms
[2026-05-25 04:08:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6130514891782693496.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9808970082147681301.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6130514891782693496.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6130514891782693496.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.01029,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.010554,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.010723,4404,2,5,12,685,8,0,27,660,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-06 in 185321 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3967610833754510503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15990004283895799729.kers'
[2026-05-25 04:08:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3967610833754510503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15990004283895799729.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:08:27] [INFO ] Computed 52 invariants in 139 ms
Computed 52 P flows in 139 ms.
Exported basis to /tmp/petrispot-output-15990004283895799729.kers
Total runtime 150 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 141 ms. (70 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:08:27] [INFO ] Invariant cache hit.
[2026-05-25 04:08:27] [INFO ] [Real]Absence check using 50 positive place invariants in 37 ms returned sat
[2026-05-25 04:08:27] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:08:29] [INFO ] [Real]Absence check using state equation in 2014 ms returned sat
[2026-05-25 04:08:29] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:08:30] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:08:31] [INFO ] [Real]Added 9982 Read/Feed constraints in 1170 ms returned sat
[2026-05-25 04:08:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:08:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:08:31] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 04:08:33] [INFO ] [Nat]Absence check using state equation in 2018 ms returned sat
[2026-05-25 04:08:34] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:08:34] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1464 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1711 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1711 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9358680025143246514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18321240278348298110.kers'
[2026-05-25 04:08:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9358680025143246514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18321240278348298110.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 04:08:36] [INFO ] Computed 52 invariants in 138 ms
Computed 52 P flows in 138 ms.
Exported basis to /tmp/petrispot-output-18321240278348298110.kers
Total runtime 148 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4359 resets) in 14291 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1313 ms. (761 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:08:52] [INFO ] Invariant cache hit.
[2026-05-25 04:08:52] [INFO ] [Real]Absence check using 50 positive place invariants in 37 ms returned sat
[2026-05-25 04:08:52] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:08:54] [INFO ] [Real]Absence check using state equation in 1934 ms returned sat
[2026-05-25 04:08:54] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:08:55] [INFO ] [Real]Added 10002 Read/Feed constraints in 1066 ms returned sat
[2026-05-25 04:08:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:08:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:08:56] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 04:08:58] [INFO ] [Nat]Absence check using state equation in 1930 ms returned sat
[2026-05-25 04:08:59] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1536 ms returned sat
[2026-05-25 04:09:00] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 443 ms.
[2026-05-25 04:09:02] [INFO ] Added : 7 causal constraints over 2 iterations in 2086 ms. Result :sat
Minimization took 5081 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 468 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 463 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:09:08] [INFO ] Invariant cache hit.
[2026-05-25 04:09:11] [INFO ] Implicit Places using invariants in 3440 ms returned []
Implicit Place search using SMT only with invariants took 3440 ms to find 0 implicit places.
Running 10102 sub problems to find dead transitions.
[2026-05-25 04:09:11] [INFO ] Invariant cache hit.
[2026-05-25 04:09:11] [INFO ] State equation strengthened by 10002 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10102 unsolved
SMT process timed out in 39309ms, After SMT, problems are : Problem set: 0 solved, 10102 unsolved
Search for dead transitions found 0 dead transitions in 39323ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43240 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 04:09:51] [INFO ] Flatten gal took : 267 ms
RANDOM walk for 40000 steps (172 resets) in 1224 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2026-05-25 04:09:51] [INFO ] Flatten gal took : 126 ms
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2026-05-25 04:09:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality272714690202289977.gal : 33 ms
[2026-05-25 04:09:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9591366711152929057.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality272714690202289977.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9591366711152929057.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality9591366711152929057.prop.
Interrupted probabilistic random walk after 82030 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82030 steps, saw 28727 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:09:54] [INFO ] Invariant cache hit.
[2026-05-25 04:09:54] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6956ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 480 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (172 resets) in 967 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 82589 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82589 steps, saw 28765 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:10:05] [INFO ] Invariant cache hit.
[2026-05-25 04:10:05] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:10:41] [INFO ] Flatten gal took : 127 ms
[2026-05-25 04:10:41] [INFO ] Applying decomposition
[2026-05-25 04:10:41] [INFO ] Flatten gal took : 130 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/graph17589785036541370895.txt' '-o' '/tmp/graph17589785036541370895.bin' '-w' '/tmp/graph17589785036541370895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17589785036541370895.bin' '-l' '-1' '-v' '-w' '/tmp/graph17589785036541370895.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:10:42] [INFO ] Decomposing Gal with order
[2026-05-25 04:10:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:10:42] [INFO ] Removed a total of 7699 redundant transitions.
[2026-05-25 04:10:42] [INFO ] Flatten gal took : 549 ms
[2026-05-25 04:10:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 9656 labels/synchronizations in 493 ms.
[2026-05-25 04:10:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2482025695332807950.gal : 55 ms
[2026-05-25 04:10:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11785526472330849083.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2482025695332807950.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11785526472330849083.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11785526472330849083.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5897
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5897 after 5897
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5897 after 5897
SMT process timed out in 45210ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 469 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 465 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:10:51] [INFO ] Invariant cache hit.
[2026-05-25 04:10:55] [INFO ] Implicit Places using invariants in 3610 ms returned []
Implicit Place search using SMT only with invariants took 3610 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4078 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9849 edges and 2802 vertex of which 2598 / 2802 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2596 places
Drop transitions (Empty/Sink Transition effects.) removed 7401 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9943 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 21 ms. Remains 4 /2802 variables (removed 2798) and now considering 5/10152 (removed 10147) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9238394313409578821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3124623650113772353.kers'
[2026-05-25 04:10:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9238394313409578821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3124623650113772353.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:10:55] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3124623650113772353.kers
Total runtime 1 ms.
[2026-05-25 04:10:55] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:10:55] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:10:55] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:10:55] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:10:55] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:10:55] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:10:55] [INFO ] Flatten gal took : 1 ms
[2026-05-25 04:10:55] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:10:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7025411624679644903.gal : 0 ms
[2026-05-25 04:10:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8709529050699360433.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7025411624679644903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8709529050699360433.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8709529050699360433.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.009509,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009933,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.01017,4400,2,5,12,685,8,0,27,660,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 100 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-07 in 148144 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3415274180348701307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11373954565264268244.kers'
[2026-05-25 04:10:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3415274180348701307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11373954565264268244.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:10:55] [INFO ] Computed 52 invariants in 135 ms
Computed 52 P flows in 135 ms.
Exported basis to /tmp/petrispot-output-11373954565264268244.kers
Total runtime 144 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 142 ms. (69 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 68 ms. (144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[49]
[2026-05-25 04:10:55] [INFO ] Invariant cache hit.
[2026-05-25 04:10:55] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:10:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:10:57] [INFO ] [Real]Absence check using state equation in 2121 ms returned sat
[2026-05-25 04:10:58] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:10:59] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:10:59] [INFO ] [Real]Added 9982 Read/Feed constraints in 1394 ms returned sat
[2026-05-25 04:10:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:10:59] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:11:02] [INFO ] [Nat]Absence check using state equation in 2113 ms returned sat
[2026-05-25 04:11:03] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:11:03] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1371 ms returned sat
[2026-05-25 04:11:04] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 418 ms.
[2026-05-25 04:11:04] [INFO ] Added : 0 causal constraints over 0 iterations in 1053 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1747 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1748 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10811569490424294251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6644440275794974774.kers'
[2026-05-25 04:11:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10811569490424294251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6644440275794974774.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 04:11:06] [INFO ] Computed 52 invariants in 134 ms
Computed 52 P flows in 134 ms.
Exported basis to /tmp/petrispot-output-6644440275794974774.kers
Total runtime 145 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4357 resets) in 14400 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1316 ms. (759 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:11:22] [INFO ] Invariant cache hit.
[2026-05-25 04:11:22] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 04:11:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:11:24] [INFO ] [Real]Absence check using state equation in 1978 ms returned sat
[2026-05-25 04:11:24] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:11:25] [INFO ] [Real]Added 10002 Read/Feed constraints in 1031 ms returned sat
[2026-05-25 04:11:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:11:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:11:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:11:28] [INFO ] [Nat]Absence check using state equation in 1966 ms returned sat
[2026-05-25 04:11:29] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1207 ms returned sat
[2026-05-25 04:11:30] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 437 ms.
[2026-05-25 04:11:31] [INFO ] Added : 7 causal constraints over 2 iterations in 2073 ms. Result :sat
Minimization took 5077 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 478 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 467 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:11:37] [INFO ] Invariant cache hit.
[2026-05-25 04:11:41] [INFO ] Implicit Places using invariants in 3453 ms returned []
Implicit Place search using SMT only with invariants took 3455 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3923 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 04:11:41] [INFO ] Flatten gal took : 160 ms
RANDOM walk for 40000 steps (172 resets) in 837 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
[2026-05-25 04:11:41] [INFO ] Flatten gal took : 168 ms
[2026-05-25 04:11:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3053538042534102655.gal : 58 ms
[2026-05-25 04:11:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13275980444724439990.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3053538042534102655.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13275980444724439990.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13275980444724439990.prop.
Interrupted probabilistic random walk after 82332 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82332 steps, saw 28750 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:11:44] [INFO ] Invariant cache hit.
[2026-05-25 04:11:44] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 7032ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 472 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (171 resets) in 900 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 82095 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82095 steps, saw 28733 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:11:55] [INFO ] Invariant cache hit.
[2026-05-25 04:11:55] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:12:31] [INFO ] Flatten gal took : 121 ms
[2026-05-25 04:12:31] [INFO ] Applying decomposition
[2026-05-25 04:12:32] [INFO ] Flatten gal took : 124 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/graph15257892259164474358.txt' '-o' '/tmp/graph15257892259164474358.bin' '-w' '/tmp/graph15257892259164474358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15257892259164474358.bin' '-l' '-1' '-v' '-w' '/tmp/graph15257892259164474358.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:12:32] [INFO ] Decomposing Gal with order
[2026-05-25 04:12:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:12:32] [INFO ] Removed a total of 7699 redundant transitions.
[2026-05-25 04:12:33] [INFO ] Flatten gal took : 551 ms
[2026-05-25 04:12:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 9656 labels/synchronizations in 492 ms.
[2026-05-25 04:12:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10029227828610904197.gal : 55 ms
[2026-05-25 04:12:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13639840149153691268.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10029227828610904197.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13639840149153691268.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13639840149153691268.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 125
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :125 after 166
SMT process timed out in 45129ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 560 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 488 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:12:41] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :166 after 32399
[2026-05-25 04:12:45] [INFO ] Implicit Places using invariants in 3836 ms returned []
Implicit Place search using SMT only with invariants took 3837 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4330 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9849 edges and 2802 vertex of which 2598 / 2802 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2596 places
Drop transitions (Empty/Sink Transition effects.) removed 7401 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9943 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 19 ms. Remains 4 /2802 variables (removed 2798) and now considering 5/10152 (removed 10147) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14723877969897916283.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4427919939910259203.kers'
[2026-05-25 04:12:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14723877969897916283.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4427919939910259203.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:12:45] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4427919939910259203.kers
Total runtime 1 ms.
[2026-05-25 04:12:45] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:12:45] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:12:45] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:12:45] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:12:45] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:12:45] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:12:45] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:12:45] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:12:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality958104458487026253.gal : 0 ms
[2026-05-25 04:12:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4145188748322463309.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality958104458487026253.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4145188748322463309.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality4145188748322463309.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.009759,4180,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.010109,4316,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.010372,4408,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 92 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-08 in 110481 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4625825733468698739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4657142940752141353.kers'
[2026-05-25 04:12:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4625825733468698739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4657142940752141353.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:12:45] [INFO ] Computed 52 invariants in 138 ms
Computed 52 P flows in 139 ms.
Exported basis to /tmp/petrispot-output-4657142940752141353.kers
Total runtime 147 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 145 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:12:45] [INFO ] Invariant cache hit.
[2026-05-25 04:12:46] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:12:46] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:12:48] [INFO ] [Real]Absence check using state equation in 2191 ms returned sat
[2026-05-25 04:12:48] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:12:49] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:12:50] [INFO ] [Real]Added 9982 Read/Feed constraints in 1323 ms returned sat
[2026-05-25 04:12:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:12:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:12:50] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:12:52] [INFO ] [Nat]Absence check using state equation in 2011 ms returned sat
[2026-05-25 04:12:53] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:12:54] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1507 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1797 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1798 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14557648467232318391.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16120354567027405476.kers'
[2026-05-25 04:12:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14557648467232318391.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16120354567027405476.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 04:12:55] [INFO ] Computed 52 invariants in 140 ms
Computed 52 P flows in 141 ms.
Exported basis to /tmp/petrispot-output-16120354567027405476.kers
Total runtime 150 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4358 resets) in 16309 ms. (61 steps per ms)
BEST_FIRST walk for 1000001 steps (71 resets) in 1481 ms. (674 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:13:13] [INFO ] Invariant cache hit.
[2026-05-25 04:13:14] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:13:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:13:16] [INFO ] [Real]Absence check using state equation in 2108 ms returned sat
[2026-05-25 04:13:16] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:13:17] [INFO ] [Real]Added 10002 Read/Feed constraints in 1099 ms returned sat
[2026-05-25 04:13:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 04:13:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:13:20] [INFO ] [Nat]Absence check using state equation in 2131 ms returned sat
[2026-05-25 04:13:21] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1335 ms returned sat
[2026-05-25 04:13:22] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 513 ms.
[2026-05-25 04:13:23] [INFO ] Added : 7 causal constraints over 2 iterations in 2215 ms. Result :sat
Minimization took 5075 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 501 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 488 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:13:30] [INFO ] Invariant cache hit.
[2026-05-25 04:13:33] [INFO ] Implicit Places using invariants in 3534 ms returned []
Implicit Place search using SMT only with invariants took 3534 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4024 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 04:13:33] [INFO ] Flatten gal took : 128 ms
RANDOM walk for 40000 steps (172 resets) in 862 ms. (46 steps per ms) remains 2/2 properties
[2026-05-25 04:13:33] [INFO ] Flatten gal took : 132 ms
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
[2026-05-25 04:13:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2867313158186299.gal : 31 ms
[2026-05-25 04:13:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7116111293763327834.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2867313158186299.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7116111293763327834.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...325
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7116111293763327834.prop.
Interrupted probabilistic random walk after 79124 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 79124 steps, saw 28435 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:13:36] [INFO ] Invariant cache hit.
[2026-05-25 04:13:36] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 7163ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 468 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (173 resets) in 921 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 78682 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 78682 steps, saw 28387 distinct states, run finished after 3012 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:13:47] [INFO ] Invariant cache hit.
[2026-05-25 04:13:47] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:14:24] [INFO ] Flatten gal took : 122 ms
[2026-05-25 04:14:24] [INFO ] Applying decomposition
[2026-05-25 04:14:24] [INFO ] Flatten gal took : 129 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/graph7203316376141339159.txt' '-o' '/tmp/graph7203316376141339159.bin' '-w' '/tmp/graph7203316376141339159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7203316376141339159.bin' '-l' '-1' '-v' '-w' '/tmp/graph7203316376141339159.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:14:24] [INFO ] Decomposing Gal with order
[2026-05-25 04:14:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:14:25] [INFO ] Removed a total of 7699 redundant transitions.
[2026-05-25 04:14:25] [INFO ] Flatten gal took : 568 ms
[2026-05-25 04:14:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 9656 labels/synchronizations in 485 ms.
[2026-05-25 04:14:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1699937854861866246.gal : 48 ms
[2026-05-25 04:14:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17627672308088604430.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1699937854861866246.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17627672308088604430.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17627672308088604430.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4890
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4890 after 4890
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4890 after 5017
SMT process timed out in 45855ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 512 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 518 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:14:34] [INFO ] Invariant cache hit.
[2026-05-25 04:14:38] [INFO ] Implicit Places using invariants in 3549 ms returned []
Implicit Place search using SMT only with invariants took 3552 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4075 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9849 edges and 2802 vertex of which 2598 / 2802 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2596 places
Drop transitions (Empty/Sink Transition effects.) removed 7401 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9943 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 19 ms. Remains 4 /2802 variables (removed 2798) and now considering 5/10152 (removed 10147) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17153025592838928617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4747936632687112886.kers'
[2026-05-25 04:14:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17153025592838928617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4747936632687112886.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:14:38] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4747936632687112886.kers
Total runtime 2 ms.
[2026-05-25 04:14:38] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:14:38] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:14:38] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:14:38] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:14:38] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:14:38] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:14:38] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:14:38] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:14:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7782484638975097512.gal : 1 ms
[2026-05-25 04:14:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1026811552227444857.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7782484638975097512.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1026811552227444857.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1026811552227444857.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.010619,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.010992,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.011219,4396,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 99 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-09 in 112889 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-279619213905213441.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3067396117650677512.kers'
[2026-05-25 04:14:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-279619213905213441.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3067396117650677512.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:14:38] [INFO ] Computed 52 invariants in 135 ms
Computed 52 P flows in 135 ms.
Exported basis to /tmp/petrispot-output-3067396117650677512.kers
Total runtime 146 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 143 ms. (69 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:14:38] [INFO ] Invariant cache hit.
[2026-05-25 04:14:39] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:14:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:14:41] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2026-05-25 04:14:41] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:14:42] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:14:42] [INFO ] [Real]Added 9982 Read/Feed constraints in 1375 ms returned sat
[2026-05-25 04:14:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:14:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 04:14:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:14:45] [INFO ] [Nat]Absence check using state equation in 2103 ms returned sat
[2026-05-25 04:14:46] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:14:46] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1520 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1831 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1832 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6964649289011247298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7506012357840734703.kers'
[2026-05-25 04:14:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6964649289011247298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7506012357840734703.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 04:14:48] [INFO ] Computed 52 invariants in 139 ms
Computed 52 P flows in 139 ms.
Exported basis to /tmp/petrispot-output-7506012357840734703.kers
Total runtime 154 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4357 resets) in 15012 ms. (66 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1370 ms. (729 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:15:05] [INFO ] Invariant cache hit.
[2026-05-25 04:15:05] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:15:05] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:15:07] [INFO ] [Real]Absence check using state equation in 1988 ms returned sat
[2026-05-25 04:15:07] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:15:08] [INFO ] [Real]Added 10002 Read/Feed constraints in 1116 ms returned sat
[2026-05-25 04:15:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:15:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:15:09] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:15:11] [INFO ] [Nat]Absence check using state equation in 2042 ms returned sat
[2026-05-25 04:15:12] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1456 ms returned sat
[2026-05-25 04:15:13] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 435 ms.
[2026-05-25 04:15:15] [INFO ] Added : 6 causal constraints over 2 iterations in 2144 ms. Result :sat
Minimization took 5066 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 482 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 482 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 465 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:15:21] [INFO ] Invariant cache hit.
[2026-05-25 04:15:24] [INFO ] Implicit Places using invariants in 3412 ms returned []
Implicit Place search using SMT only with invariants took 3412 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3878 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 04:15:24] [INFO ] Flatten gal took : 172 ms
RANDOM walk for 40000 steps (171 resets) in 910 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
[2026-05-25 04:15:24] [INFO ] Flatten gal took : 157 ms
[2026-05-25 04:15:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10334621885716601089.gal : 36 ms
[2026-05-25 04:15:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18006697869065703904.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10334621885716601089.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18006697869065703904.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality18006697869065703904.prop.
Interrupted probabilistic random walk after 81169 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81169 steps, saw 28641 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:15:27] [INFO ] Invariant cache hit.
[2026-05-25 04:15:27] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6933ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 483 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (172 resets) in 868 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 80978 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80978 steps, saw 28629 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:15:38] [INFO ] Invariant cache hit.
[2026-05-25 04:15:38] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:16:15] [INFO ] Flatten gal took : 125 ms
[2026-05-25 04:16:15] [INFO ] Applying decomposition
[2026-05-25 04:16:15] [INFO ] Flatten gal took : 128 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/graph5769814210378564657.txt' '-o' '/tmp/graph5769814210378564657.bin' '-w' '/tmp/graph5769814210378564657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5769814210378564657.bin' '-l' '-1' '-v' '-w' '/tmp/graph5769814210378564657.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:16:15] [INFO ] Decomposing Gal with order
[2026-05-25 04:16:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:16:16] [INFO ] Removed a total of 7695 redundant transitions.
[2026-05-25 04:16:16] [INFO ] Flatten gal took : 572 ms
[2026-05-25 04:16:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 9366 labels/synchronizations in 505 ms.
[2026-05-25 04:16:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11114651894527087772.gal : 59 ms
[2026-05-25 04:16:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16147341545181846756.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11114651894527087772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16147341545181846756.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16147341545181846756.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 95
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :95 after 95
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :95 after 95
SMT process timed out in 47455ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 486 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 481 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:16:27] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :95 after 17043
[2026-05-25 04:16:30] [INFO ] Implicit Places using invariants in 3541 ms returned []
Implicit Place search using SMT only with invariants took 3541 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4025 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9849 edges and 2802 vertex of which 2598 / 2802 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2596 places
Drop transitions (Empty/Sink Transition effects.) removed 7401 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9943 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 16 ms. Remains 4 /2802 variables (removed 2798) and now considering 5/10152 (removed 10147) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17295888458713229536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1033583023178971371.kers'
[2026-05-25 04:16:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17295888458713229536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1033583023178971371.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:16:30] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1033583023178971371.kers
Total runtime 0 ms.
[2026-05-25 04:16:30] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:16:30] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:16:30] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:16:30] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:16:30] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:16:30] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:16:30] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:16:30] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:16:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4705248344694507070.gal : 1 ms
[2026-05-25 04:16:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6467273175432333652.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4705248344694507070.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6467273175432333652.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6467273175432333652.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.009026,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009359,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.009568,4396,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 85 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-10 in 112271 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-864735314654342186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9286766065554555818.kers'
[2026-05-25 04:16:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-864735314654342186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9286766065554555818.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:16:30] [INFO ] Computed 52 invariants in 137 ms
Computed 52 P flows in 138 ms.
Exported basis to /tmp/petrispot-output-9286766065554555818.kers
Total runtime 146 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 152 ms. (65 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:16:31] [INFO ] Invariant cache hit.
[2026-05-25 04:16:31] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 04:16:31] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:16:33] [INFO ] [Real]Absence check using state equation in 2279 ms returned sat
[2026-05-25 04:16:33] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:16:34] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:16:35] [INFO ] [Real]Added 9982 Read/Feed constraints in 1181 ms returned sat
[2026-05-25 04:16:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:16:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2026-05-25 04:16:35] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 10 ms returned sat
[2026-05-25 04:16:37] [INFO ] [Nat]Absence check using state equation in 2312 ms returned sat
[2026-05-25 04:16:38] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:16:39] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1496 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1795 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1795 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1500251878999262406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15577565107129045038.kers'
[2026-05-25 04:16:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1500251878999262406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15577565107129045038.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 04:16:41] [INFO ] Computed 52 invariants in 136 ms
Computed 52 P flows in 137 ms.
Exported basis to /tmp/petrispot-output-15577565107129045038.kers
Total runtime 148 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4352 resets) in 14602 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1340 ms. (745 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:16:57] [INFO ] Invariant cache hit.
[2026-05-25 04:16:57] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 04:16:57] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:16:59] [INFO ] [Real]Absence check using state equation in 1989 ms returned sat
[2026-05-25 04:16:59] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:17:01] [INFO ] [Real]Added 10002 Read/Feed constraints in 1298 ms returned sat
[2026-05-25 04:17:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:17:01] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 04:17:01] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 04:17:03] [INFO ] [Nat]Absence check using state equation in 2043 ms returned sat
[2026-05-25 04:17:04] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1246 ms returned sat
[2026-05-25 04:17:05] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 439 ms.
[2026-05-25 04:17:07] [INFO ] Added : 6 causal constraints over 2 iterations in 2147 ms. Result :sat
Minimization took 5082 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 471 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 476 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:17:13] [INFO ] Invariant cache hit.
[2026-05-25 04:17:16] [INFO ] Implicit Places using invariants in 3510 ms returned []
Implicit Place search using SMT only with invariants took 3510 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3988 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 04:17:17] [INFO ] Flatten gal took : 191 ms
RANDOM walk for 40000 steps (173 resets) in 742 ms. (53 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2026-05-25 04:17:17] [INFO ] Flatten gal took : 163 ms
[2026-05-25 04:17:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6054346207605575336.gal : 31 ms
[2026-05-25 04:17:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12582555592791172582.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6054346207605575336.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12582555592791172582.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12582555592791172582.prop.
Interrupted probabilistic random walk after 80818 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80818 steps, saw 28614 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:17:20] [INFO ] Invariant cache hit.
[2026-05-25 04:17:20] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 7329ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 460 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (172 resets) in 852 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 80969 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80969 steps, saw 28628 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:17:31] [INFO ] Invariant cache hit.
[2026-05-25 04:17:31] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:18:07] [INFO ] Flatten gal took : 124 ms
[2026-05-25 04:18:07] [INFO ] Applying decomposition
[2026-05-25 04:18:07] [INFO ] Flatten gal took : 126 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/graph6876749734679549420.txt' '-o' '/tmp/graph6876749734679549420.bin' '-w' '/tmp/graph6876749734679549420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6876749734679549420.bin' '-l' '-1' '-v' '-w' '/tmp/graph6876749734679549420.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:18:07] [INFO ] Decomposing Gal with order
[2026-05-25 04:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:18:08] [INFO ] Removed a total of 7699 redundant transitions.
[2026-05-25 04:18:08] [INFO ] Flatten gal took : 565 ms
[2026-05-25 04:18:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 9656 labels/synchronizations in 495 ms.
[2026-05-25 04:18:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13637980138698872293.gal : 59 ms
[2026-05-25 04:18:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8760233483529261849.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13637980138698872293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8760233483529261849.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8760233483529261849.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6393
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6393 after 6393
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6393 after 6393
SMT process timed out in 47016ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 491 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 503 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:18:19] [INFO ] Invariant cache hit.
[2026-05-25 04:18:22] [INFO ] Implicit Places using invariants in 3619 ms returned []
Implicit Place search using SMT only with invariants took 3619 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4124 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9849 edges and 2802 vertex of which 2598 / 2802 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2596 places
Drop transitions (Empty/Sink Transition effects.) removed 7401 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9943 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 16 ms. Remains 4 /2802 variables (removed 2798) and now considering 5/10152 (removed 10147) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6763430065213938472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15471913675882326810.kers'
[2026-05-25 04:18:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6763430065213938472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15471913675882326810.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:18:22] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15471913675882326810.kers
Total runtime 1 ms.
[2026-05-25 04:18:22] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:18:22] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:18:22] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:18:22] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:18:22] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:18:22] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:18:22] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:18:22] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:18:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2270366486838987141.gal : 0 ms
[2026-05-25 04:18:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13272897734842825570.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2270366486838987141.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13272897734842825570.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13272897734842825570.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.009252,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009568,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.009785,4400,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 86 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-11 in 112247 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7360432963485888038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14026984364244381106.kers'
[2026-05-25 04:18:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7360432963485888038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14026984364244381106.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:18:23] [INFO ] Computed 52 invariants in 136 ms
Computed 52 P flows in 137 ms.
Exported basis to /tmp/petrispot-output-14026984364244381106.kers
Total runtime 146 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 174 ms. (57 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[49]
[2026-05-25 04:18:23] [INFO ] Invariant cache hit.
[2026-05-25 04:18:23] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 04:18:23] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:18:25] [INFO ] [Real]Absence check using state equation in 1979 ms returned sat
[2026-05-25 04:18:25] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:18:26] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:18:27] [INFO ] [Real]Added 9982 Read/Feed constraints in 1342 ms returned sat
[2026-05-25 04:18:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:18:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 04:18:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:18:29] [INFO ] [Nat]Absence check using state equation in 2005 ms returned sat
[2026-05-25 04:18:30] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:18:30] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1116 ms returned sat
[2026-05-25 04:18:31] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 440 ms.
[2026-05-25 04:18:32] [INFO ] Added : 2 causal constraints over 2 iterations in 1411 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 2803 transition count 10154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 2803 transition count 10153
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 2803 transition count 10153
Applied a total of 21 rules in 1774 ms. Remains 2803 /2808 variables (removed 5) and now considering 10153/10159 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1774 ms. Remains : 2803/2808 places, 10153/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-57422218342001896.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10172474694726070543.kers'
[2026-05-25 04:18:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-57422218342001896.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10172474694726070543.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10153 rows 2803 cols 20754 entries
Finished phase 1 with 2701 SingleSign rule and 50 generalized
[2026-05-25 04:18:34] [INFO ] Computed 52 invariants in 134 ms
Computed 52 P flows in 134 ms.
Exported basis to /tmp/petrispot-output-10172474694726070543.kers
Total runtime 148 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4356 resets) in 14730 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1353 ms. (738 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:18:50] [INFO ] Invariant cache hit.
[2026-05-25 04:18:50] [INFO ] [Real]Absence check using 50 positive place invariants in 38 ms returned sat
[2026-05-25 04:18:50] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:18:52] [INFO ] [Real]Absence check using state equation in 1978 ms returned sat
[2026-05-25 04:18:52] [INFO ] State equation strengthened by 10001 read => feed constraints.
[2026-05-25 04:18:54] [INFO ] [Real]Added 10001 Read/Feed constraints in 1096 ms returned sat
[2026-05-25 04:18:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:18:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 04:18:54] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:18:56] [INFO ] [Nat]Absence check using state equation in 2028 ms returned sat
[2026-05-25 04:18:58] [INFO ] [Nat]Added 10001 Read/Feed constraints in 1721 ms returned sat
[2026-05-25 04:18:58] [INFO ] Computed and/alt/rep : 7359/19569/7359 causal constraints (skipped 2744 transitions) in 451 ms.
[2026-05-25 04:19:00] [INFO ] Added : 10 causal constraints over 2 iterations in 2135 ms. Result :sat
Minimization took 5071 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 464 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 480 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:19:06] [INFO ] Invariant cache hit.
[2026-05-25 04:19:10] [INFO ] Implicit Places using invariants in 3464 ms returned []
Implicit Place search using SMT only with invariants took 3465 ms to find 0 implicit places.
Running 10103 sub problems to find dead transitions.
[2026-05-25 04:19:10] [INFO ] Invariant cache hit.
[2026-05-25 04:19:10] [INFO ] State equation strengthened by 10001 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10103 unsolved
SMT process timed out in 39568ms, After SMT, problems are : Problem set: 0 solved, 10103 unsolved
Search for dead transitions found 0 dead transitions in 39583ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43542 ms. Remains : 2803/2803 places, 10153/10153 transitions.
[2026-05-25 04:19:50] [INFO ] Flatten gal took : 210 ms
RANDOM walk for 40000 steps (171 resets) in 729 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
[2026-05-25 04:19:50] [INFO ] Flatten gal took : 158 ms
[2026-05-25 04:19:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10022386638411258737.gal : 37 ms
[2026-05-25 04:19:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7832445417106492906.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10022386638411258737.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7832445417106492906.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7832445417106492906.prop.
Interrupted probabilistic random walk after 82040 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82040 steps, saw 28727 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:19:53] [INFO ] Invariant cache hit.
[2026-05-25 04:19:53] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6634ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 515 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 2803/2803 places, 10153/10153 transitions.
RANDOM walk for 40000 steps (173 resets) in 767 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 81236 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81236 steps, saw 28645 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:20:03] [INFO ] Invariant cache hit.
[2026-05-25 04:20:03] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:20:40] [INFO ] Flatten gal took : 123 ms
[2026-05-25 04:20:40] [INFO ] Applying decomposition
[2026-05-25 04:20:40] [INFO ] Flatten gal took : 130 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/graph13456927133763677401.txt' '-o' '/tmp/graph13456927133763677401.bin' '-w' '/tmp/graph13456927133763677401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13456927133763677401.bin' '-l' '-1' '-v' '-w' '/tmp/graph13456927133763677401.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:20:40] [INFO ] Decomposing Gal with order
[2026-05-25 04:20:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:20:41] [INFO ] Removed a total of 7698 redundant transitions.
[2026-05-25 04:20:41] [INFO ] Flatten gal took : 561 ms
[2026-05-25 04:20:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 9752 labels/synchronizations in 495 ms.
[2026-05-25 04:20:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5634078792933653593.gal : 54 ms
[2026-05-25 04:20:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4805323245607235233.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5634078792933653593.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4805323245607235233.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4805323245607235233.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5844
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5844 after 5844
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5844 after 5968
SMT process timed out in 46844ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 469 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 563 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:20:51] [INFO ] Invariant cache hit.
[2026-05-25 04:20:55] [INFO ] Implicit Places using invariants in 3658 ms returned []
Implicit Place search using SMT only with invariants took 3659 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4223 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9850 edges and 2803 vertex of which 2599 / 2803 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2597 places
Drop transitions (Empty/Sink Transition effects.) removed 7402 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9944 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 15 ms. Remains 4 /2803 variables (removed 2799) and now considering 5/10153 (removed 10148) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6825078047492306121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8226297899936245334.kers'
[2026-05-25 04:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6825078047492306121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8226297899936245334.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:20:55] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8226297899936245334.kers
Total runtime 0 ms.
[2026-05-25 04:20:55] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:20:55] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:20:55] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:20:55] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:20:55] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:20:55] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:20:55] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:20:55] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:20:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3822625189819589703.gal : 0 ms
[2026-05-25 04:20:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality235133427454665160.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3822625189819589703.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality235133427454665160.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality235133427454665160.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.008982,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009334,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.009615,4404,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 93 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-12 in 152172 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14947721946214548918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17485376656743616326.kers'
[2026-05-25 04:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14947721946214548918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17485376656743616326.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:20:55] [INFO ] Computed 52 invariants in 133 ms
Computed 52 P flows in 133 ms.
Exported basis to /tmp/petrispot-output-17485376656743616326.kers
Total runtime 146 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 142 ms. (69 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[49]
[2026-05-25 04:20:55] [INFO ] Invariant cache hit.
[2026-05-25 04:20:55] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:20:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:20:57] [INFO ] [Real]Absence check using state equation in 1926 ms returned sat
[2026-05-25 04:20:57] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:20:58] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:20:59] [INFO ] [Real]Added 9982 Read/Feed constraints in 1310 ms returned sat
[2026-05-25 04:20:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:20:59] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:21:01] [INFO ] [Nat]Absence check using state equation in 1998 ms returned sat
[2026-05-25 04:21:02] [INFO ] [Nat]Added 9982 Read/Feed constraints in 955 ms returned sat
[2026-05-25 04:21:03] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 422 ms.
[2026-05-25 04:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 1125 ms. Result :sat
Minimization took 460 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2802 transition count 10153
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 2802 transition count 10152
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 22 place count 2802 transition count 10152
Applied a total of 22 rules in 1773 ms. Remains 2802 /2808 variables (removed 6) and now considering 10152/10159 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1773 ms. Remains : 2802/2808 places, 10152/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12017138344619506409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5731603645916839969.kers'
[2026-05-25 04:21:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12017138344619506409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5731603645916839969.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10152 rows 2802 cols 20752 entries
Finished phase 1 with 2700 SingleSign rule and 50 generalized
[2026-05-25 04:21:06] [INFO ] Computed 52 invariants in 141 ms
Computed 52 P flows in 141 ms.
Exported basis to /tmp/petrispot-output-5731603645916839969.kers
Total runtime 151 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 1000000 steps (4358 resets) in 14568 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1313 ms. (761 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:21:22] [INFO ] Invariant cache hit.
[2026-05-25 04:21:22] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 04:21:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:21:24] [INFO ] [Real]Absence check using state equation in 2196 ms returned sat
[2026-05-25 04:21:25] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:21:26] [INFO ] [Real]Added 10002 Read/Feed constraints in 1271 ms returned sat
[2026-05-25 04:21:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:21:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:21:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:21:28] [INFO ] [Nat]Absence check using state equation in 1999 ms returned sat
[2026-05-25 04:21:30] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1328 ms returned sat
[2026-05-25 04:21:30] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 431 ms.
[2026-05-25 04:21:32] [INFO ] Added : 7 causal constraints over 2 iterations in 2173 ms. Result :sat
Minimization took 5132 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 508 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 487 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:21:38] [INFO ] Invariant cache hit.
[2026-05-25 04:21:42] [INFO ] Implicit Places using invariants in 3534 ms returned []
Implicit Place search using SMT only with invariants took 3534 ms to find 0 implicit places.
Running 10102 sub problems to find dead transitions.
[2026-05-25 04:21:42] [INFO ] Invariant cache hit.
[2026-05-25 04:21:42] [INFO ] State equation strengthened by 10002 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10102 unsolved
SMT process timed out in 40959ms, After SMT, problems are : Problem set: 0 solved, 10102 unsolved
Search for dead transitions found 0 dead transitions in 40977ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45015 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 04:22:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4354 resets) in 14814 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1348 ms. (741 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:22:39] [INFO ] Invariant cache hit.
[2026-05-25 04:22:39] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:22:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:22:41] [INFO ] [Real]Absence check using state equation in 1947 ms returned sat
[2026-05-25 04:22:41] [INFO ] State equation strengthened by 10002 read => feed constraints.
[2026-05-25 04:22:42] [INFO ] [Real]Added 10002 Read/Feed constraints in 1120 ms returned sat
[2026-05-25 04:22:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:22:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:22:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:22:45] [INFO ] [Nat]Absence check using state equation in 2026 ms returned sat
[2026-05-25 04:22:46] [INFO ] [Nat]Added 10002 Read/Feed constraints in 1372 ms returned sat
[2026-05-25 04:22:47] [INFO ] Computed and/alt/rep : 7358/19571/7358 causal constraints (skipped 2744 transitions) in 442 ms.
[2026-05-25 04:22:49] [INFO ] Added : 7 causal constraints over 2 iterations in 2190 ms. Result :sat
Minimization took 5070 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 516 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 471 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:22:55] [INFO ] Invariant cache hit.
[2026-05-25 04:22:58] [INFO ] Implicit Places using invariants in 3485 ms returned []
Implicit Place search using SMT only with invariants took 3485 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3958 ms. Remains : 2802/2802 places, 10152/10152 transitions.
[2026-05-25 04:22:58] [INFO ] Flatten gal took : 133 ms
RANDOM walk for 40000 steps (174 resets) in 830 ms. (48 steps per ms) remains 2/2 properties
[2026-05-25 04:22:59] [INFO ] Flatten gal took : 139 ms
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2026-05-25 04:22:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18388009349068652745.gal : 32 ms
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
[2026-05-25 04:22:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1374818623774535277.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18388009349068652745.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1374818623774535277.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1374818623774535277.prop.
Interrupted probabilistic random walk after 80845 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80845 steps, saw 28615 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:23:02] [INFO ] Invariant cache hit.
[2026-05-25 04:23:02] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6776ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 454 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 2802/2802 places, 10152/10152 transitions.
RANDOM walk for 40000 steps (172 resets) in 1009 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 81159 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81159 steps, saw 28641 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:23:12] [INFO ] Invariant cache hit.
[2026-05-25 04:23:12] [INFO ] State equation strengthened by 10002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:23:49] [INFO ] Flatten gal took : 126 ms
[2026-05-25 04:23:49] [INFO ] Applying decomposition
[2026-05-25 04:23:49] [INFO ] Flatten gal took : 129 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/graph9791567784381211973.txt' '-o' '/tmp/graph9791567784381211973.bin' '-w' '/tmp/graph9791567784381211973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9791567784381211973.bin' '-l' '-1' '-v' '-w' '/tmp/graph9791567784381211973.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:23:49] [INFO ] Decomposing Gal with order
[2026-05-25 04:23:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:23:50] [INFO ] Removed a total of 7695 redundant transitions.
[2026-05-25 04:23:50] [INFO ] Flatten gal took : 545 ms
[2026-05-25 04:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 9366 labels/synchronizations in 483 ms.
[2026-05-25 04:23:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13764136777860689080.gal : 56 ms
[2026-05-25 04:23:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1427035707842493957.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13764136777860689080.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1427035707842493957.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1427035707842493957.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 198
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :198 after 198
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :198 after 242
SMT process timed out in 45036ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 470 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10152/10152 transitions.
Applied a total of 0 rules in 474 ms. Remains 2802 /2802 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2026-05-25 04:23:58] [INFO ] Invariant cache hit.
[2026-05-25 04:24:02] [INFO ] Implicit Places using invariants in 3906 ms returned []
Implicit Place search using SMT only with invariants took 3907 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4385 ms. Remains : 2802/2802 places, 10152/10152 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9849 edges and 2802 vertex of which 2598 / 2802 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2596 places
Drop transitions (Empty/Sink Transition effects.) removed 7401 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9943 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 19 ms. Remains 4 /2802 variables (removed 2798) and now considering 5/10152 (removed 10147) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11550175001187556871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14063951601282910259.kers'
[2026-05-25 04:24:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11550175001187556871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14063951601282910259.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:24:02] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14063951601282910259.kers
Total runtime 0 ms.
[2026-05-25 04:24:02] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:24:02] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:24:02] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:24:02] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:24:02] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:24:02] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:24:02] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:24:02] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:24:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12675529874287707636.gal : 0 ms
[2026-05-25 04:24:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11173630003414548960.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12675529874287707636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11173630003414548960.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11173630003414548960.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.009002,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009345,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.009584,4404,2,5,12,685,8,0,27,660,0
Over-approximation ignoring read arcs solved 0 properties in 92 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-13 in 187551 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16417900176101536480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12972614605121950024.kers'
[2026-05-25 04:24:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16417900176101536480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12972614605121950024.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:24:02] [INFO ] Computed 52 invariants in 139 ms
Computed 52 P flows in 139 ms.
Exported basis to /tmp/petrispot-output-12972614605121950024.kers
Total runtime 146 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 147 ms. (67 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[49]
[2026-05-25 04:24:03] [INFO ] Invariant cache hit.
[2026-05-25 04:24:03] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 04:24:03] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:24:05] [INFO ] [Real]Absence check using state equation in 2202 ms returned sat
[2026-05-25 04:24:05] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:24:06] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:24:07] [INFO ] [Real]Added 9982 Read/Feed constraints in 1411 ms returned sat
[2026-05-25 04:24:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:24:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2026-05-25 04:24:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:24:10] [INFO ] [Nat]Absence check using state equation in 2402 ms returned sat
[2026-05-25 04:24:11] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:24:11] [INFO ] [Nat]Added 9982 Read/Feed constraints in 1237 ms returned sat
[2026-05-25 04:24:12] [INFO ] Computed and/alt/rep : 7365/19545/7365 causal constraints (skipped 2744 transitions) in 511 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 2803 transition count 10154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 2803 transition count 10153
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 2803 transition count 10153
Applied a total of 21 rules in 1889 ms. Remains 2803 /2808 variables (removed 5) and now considering 10153/10159 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1890 ms. Remains : 2803/2808 places, 10153/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7514776058526405747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13114577947952345043.kers'
[2026-05-25 04:24:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7514776058526405747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13114577947952345043.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10153 rows 2803 cols 20754 entries
Finished phase 1 with 2701 SingleSign rule and 50 generalized
[2026-05-25 04:24:14] [INFO ] Computed 52 invariants in 141 ms
Computed 52 P flows in 141 ms.
Exported basis to /tmp/petrispot-output-13114577947952345043.kers
Total runtime 153 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 1000000 steps (4343 resets) in 16929 ms. (59 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1456 ms. (686 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:24:32] [INFO ] Invariant cache hit.
[2026-05-25 04:24:33] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:24:33] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:24:35] [INFO ] [Real]Absence check using state equation in 2134 ms returned sat
[2026-05-25 04:24:35] [INFO ] State equation strengthened by 10001 read => feed constraints.
[2026-05-25 04:24:36] [INFO ] [Real]Added 10001 Read/Feed constraints in 1188 ms returned sat
[2026-05-25 04:24:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:24:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2026-05-25 04:24:37] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:24:39] [INFO ] [Nat]Absence check using state equation in 2182 ms returned sat
[2026-05-25 04:24:41] [INFO ] [Nat]Added 10001 Read/Feed constraints in 1623 ms returned sat
[2026-05-25 04:24:41] [INFO ] Computed and/alt/rep : 7359/19567/7359 causal constraints (skipped 2744 transitions) in 519 ms.
[2026-05-25 04:24:43] [INFO ] Added : 8 causal constraints over 2 iterations in 2393 ms. Result :sat
Minimization took 5298 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 477 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 477 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 467 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:24:50] [INFO ] Invariant cache hit.
[2026-05-25 04:24:53] [INFO ] Implicit Places using invariants in 3503 ms returned []
Implicit Place search using SMT only with invariants took 3504 ms to find 0 implicit places.
Running 10103 sub problems to find dead transitions.
[2026-05-25 04:24:53] [INFO ] Invariant cache hit.
[2026-05-25 04:24:53] [INFO ] State equation strengthened by 10001 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10103 unsolved
SMT process timed out in 39492ms, After SMT, problems are : Problem set: 0 solved, 10103 unsolved
Search for dead transitions found 0 dead transitions in 39506ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43489 ms. Remains : 2803/2803 places, 10153/10153 transitions.
[2026-05-25 04:25:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4346 resets) in 14338 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1313 ms. (761 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:25:48] [INFO ] Invariant cache hit.
[2026-05-25 04:25:48] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:25:48] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:25:50] [INFO ] [Real]Absence check using state equation in 1993 ms returned sat
[2026-05-25 04:25:51] [INFO ] State equation strengthened by 10001 read => feed constraints.
[2026-05-25 04:25:52] [INFO ] [Real]Added 10001 Read/Feed constraints in 1103 ms returned sat
[2026-05-25 04:25:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:25:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:25:52] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:25:54] [INFO ] [Nat]Absence check using state equation in 2023 ms returned sat
[2026-05-25 04:25:56] [INFO ] [Nat]Added 10001 Read/Feed constraints in 1554 ms returned sat
[2026-05-25 04:25:57] [INFO ] Computed and/alt/rep : 7359/19567/7359 causal constraints (skipped 2744 transitions) in 502 ms.
[2026-05-25 04:25:58] [INFO ] Added : 8 causal constraints over 2 iterations in 2307 ms. Result :sat
Minimization took 5079 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 479 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 481 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:26:04] [INFO ] Invariant cache hit.
[2026-05-25 04:26:08] [INFO ] Implicit Places using invariants in 3492 ms returned []
Implicit Place search using SMT only with invariants took 3494 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3977 ms. Remains : 2803/2803 places, 10153/10153 transitions.
[2026-05-25 04:26:08] [INFO ] Flatten gal took : 143 ms
RANDOM walk for 40000 steps (172 resets) in 828 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
[2026-05-25 04:26:08] [INFO ] Flatten gal took : 199 ms
[2026-05-25 04:26:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7883111759122180026.gal : 32 ms
[2026-05-25 04:26:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12112658750360568076.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7883111759122180026.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12112658750360568076.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12112658750360568076.prop.
Interrupted probabilistic random walk after 80089 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80089 steps, saw 28540 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:26:11] [INFO ] Invariant cache hit.
[2026-05-25 04:26:11] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 7077ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 541 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 2803/2803 places, 10153/10153 transitions.
RANDOM walk for 40000 steps (173 resets) in 1000 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 81399 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81399 steps, saw 28670 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:26:22] [INFO ] Invariant cache hit.
[2026-05-25 04:26:22] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:26:58] [INFO ] Flatten gal took : 123 ms
[2026-05-25 04:26:58] [INFO ] Applying decomposition
[2026-05-25 04:26:59] [INFO ] Flatten gal took : 127 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/graph9075197622690429664.txt' '-o' '/tmp/graph9075197622690429664.bin' '-w' '/tmp/graph9075197622690429664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9075197622690429664.bin' '-l' '-1' '-v' '-w' '/tmp/graph9075197622690429664.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:26:59] [INFO ] Decomposing Gal with order
[2026-05-25 04:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:27:00] [INFO ] Removed a total of 7698 redundant transitions.
[2026-05-25 04:27:00] [INFO ] Flatten gal took : 550 ms
[2026-05-25 04:27:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 9656 labels/synchronizations in 488 ms.
[2026-05-25 04:27:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4528175892098167904.gal : 57 ms
[2026-05-25 04:27:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1450731991490416430.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4528175892098167904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1450731991490416430.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1450731991490416430.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 96
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :96 after 96
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :96 after 96
SMT process timed out in 46596ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 469 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 465 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:27:10] [INFO ] Invariant cache hit.
[2026-05-25 04:27:13] [INFO ] Implicit Places using invariants in 3604 ms returned []
Implicit Place search using SMT only with invariants took 3614 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4082 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9850 edges and 2803 vertex of which 2599 / 2803 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2597 places
Drop transitions (Empty/Sink Transition effects.) removed 7402 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9944 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 18 ms. Remains 4 /2803 variables (removed 2799) and now considering 5/10153 (removed 10148) transitions.
SDD proceeding with computation,2 properties remain. new max is 32768
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12717364623655455799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4248832941449650140.kers'
[2026-05-25 04:27:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12717364623655455799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4248832941449650140.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:27:13] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4248832941449650140.kers
Total runtime 1 ms.
[2026-05-25 04:27:13] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
SDD size :96 after 30335
[2026-05-25 04:27:13] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:27:13] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:27:13] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:27:13] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:27:13] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:27:13] [INFO ] Flatten gal took : 1 ms
[2026-05-25 04:27:13] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:27:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12105650573246829959.gal : 0 ms
[2026-05-25 04:27:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15744223805898022744.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12105650573246829959.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15744223805898022744.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15744223805898022744.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.009476,4188,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009787,4324,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.010052,4412,2,5,12,685,8,0,27,660,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 104 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-14 in 191265 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[49]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7951568398646582642.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8785464621442426880.kers'
[2026-05-25 04:27:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7951568398646582642.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8785464621442426880.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10159 rows 2808 cols 20766 entries
Finished phase 1 with 2706 SingleSign rule and 50 generalized
[2026-05-25 04:27:14] [INFO ] Computed 52 invariants in 134 ms
Computed 52 P flows in 134 ms.
Exported basis to /tmp/petrispot-output-8785464621442426880.kers
Total runtime 143 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 10000 steps (43 resets) in 145 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[49]
[2026-05-25 04:27:14] [INFO ] Invariant cache hit.
[2026-05-25 04:27:14] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:27:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 04:27:16] [INFO ] [Real]Absence check using state equation in 1902 ms returned sat
[2026-05-25 04:27:16] [INFO ] State equation strengthened by 9982 read => feed constraints.
[2026-05-25 04:27:17] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 04:27:18] [INFO ] [Real]Added 9982 Read/Feed constraints in 1430 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[49]
Support contains 1 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10159/10159 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 2803 transition count 10154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 2803 transition count 10153
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 2803 transition count 10153
Applied a total of 21 rules in 1792 ms. Remains 2803 /2808 variables (removed 5) and now considering 10153/10159 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1792 ms. Remains : 2803/2808 places, 10153/10159 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9166690727645877648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8208767960752707505.kers'
[2026-05-25 04:27:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9166690727645877648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8208767960752707505.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 10153 rows 2803 cols 20754 entries
Finished phase 1 with 2701 SingleSign rule and 50 generalized
[2026-05-25 04:27:20] [INFO ] Computed 52 invariants in 138 ms
Computed 52 P flows in 139 ms.
Exported basis to /tmp/petrispot-output-8208767960752707505.kers
Total runtime 153 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[49]
RANDOM walk for 1000000 steps (4344 resets) in 14192 ms. (70 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1309 ms. (763 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:27:35] [INFO ] Invariant cache hit.
[2026-05-25 04:27:36] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:27:36] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 04:27:38] [INFO ] [Real]Absence check using state equation in 1983 ms returned sat
[2026-05-25 04:27:38] [INFO ] State equation strengthened by 10001 read => feed constraints.
[2026-05-25 04:27:39] [INFO ] [Real]Added 10001 Read/Feed constraints in 1131 ms returned sat
[2026-05-25 04:27:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2026-05-25 04:27:39] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 04:27:41] [INFO ] [Nat]Absence check using state equation in 2003 ms returned sat
[2026-05-25 04:27:43] [INFO ] [Nat]Added 10001 Read/Feed constraints in 1724 ms returned sat
[2026-05-25 04:27:44] [INFO ] Computed and/alt/rep : 7359/19569/7359 causal constraints (skipped 2744 transitions) in 451 ms.
[2026-05-25 04:27:46] [INFO ] Added : 9 causal constraints over 2 iterations in 2193 ms. Result :sat
Minimization took 5076 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 477 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 488 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:27:52] [INFO ] Invariant cache hit.
[2026-05-25 04:27:55] [INFO ] Implicit Places using invariants in 3520 ms returned []
Implicit Place search using SMT only with invariants took 3520 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4010 ms. Remains : 2803/2803 places, 10153/10153 transitions.
[2026-05-25 04:27:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[49]
RANDOM walk for 1000000 steps (4354 resets) in 14241 ms. (70 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1339 ms. (746 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[49]
[2026-05-25 04:28:11] [INFO ] Invariant cache hit.
[2026-05-25 04:28:11] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2026-05-25 04:28:11] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-25 04:28:13] [INFO ] [Real]Absence check using state equation in 2001 ms returned sat
[2026-05-25 04:28:13] [INFO ] State equation strengthened by 10001 read => feed constraints.
[2026-05-25 04:28:14] [INFO ] [Real]Added 10001 Read/Feed constraints in 1102 ms returned sat
[2026-05-25 04:28:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:28:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2026-05-25 04:28:15] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 04:28:17] [INFO ] [Nat]Absence check using state equation in 1968 ms returned sat
[2026-05-25 04:28:18] [INFO ] [Nat]Added 10001 Read/Feed constraints in 1719 ms returned sat
[2026-05-25 04:28:19] [INFO ] Computed and/alt/rep : 7359/19569/7359 causal constraints (skipped 2744 transitions) in 431 ms.
[2026-05-25 04:28:21] [INFO ] Added : 9 causal constraints over 2 iterations in 2174 ms. Result :sat
Minimization took 5081 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[49]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[49]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 455 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 456 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:28:27] [INFO ] Invariant cache hit.
[2026-05-25 04:28:30] [INFO ] Implicit Places using invariants in 3402 ms returned []
Implicit Place search using SMT only with invariants took 3402 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3859 ms. Remains : 2803/2803 places, 10153/10153 transitions.
[2026-05-25 04:28:30] [INFO ] Flatten gal took : 127 ms
[2026-05-25 04:28:31] [INFO ] Flatten gal took : 134 ms
RANDOM walk for 40000 steps (171 resets) in 947 ms. (42 steps per ms) remains 2/2 properties
[2026-05-25 04:28:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17749895777690103931.gal : 31 ms
[2026-05-25 04:28:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10737211675672182093.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17749895777690103931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10737211675672182093.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10737211675672182093.prop.
Interrupted probabilistic random walk after 81515 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81515 steps, saw 28680 distinct states, run finished after 3004 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-25 04:28:34] [INFO ] Invariant cache hit.
[2026-05-25 04:28:34] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6648ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 468 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 2803/2803 places, 10153/10153 transitions.
RANDOM walk for 40000 steps (171 resets) in 841 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 78991 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 78991 steps, saw 28424 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2026-05-25 04:28:44] [INFO ] Invariant cache hit.
[2026-05-25 04:28:44] [INFO ] State equation strengthened by 10001 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:29:21] [INFO ] Flatten gal took : 117 ms
[2026-05-25 04:29:21] [INFO ] Applying decomposition
[2026-05-25 04:29:21] [INFO ] Flatten gal took : 124 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/graph6649580838864207224.txt' '-o' '/tmp/graph6649580838864207224.bin' '-w' '/tmp/graph6649580838864207224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6649580838864207224.bin' '-l' '-1' '-v' '-w' '/tmp/graph6649580838864207224.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:29:21] [INFO ] Decomposing Gal with order
[2026-05-25 04:29:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:29:22] [INFO ] Removed a total of 7698 redundant transitions.
[2026-05-25 04:29:22] [INFO ] Flatten gal took : 553 ms
[2026-05-25 04:29:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 9754 labels/synchronizations in 492 ms.
[2026-05-25 04:29:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15815065535293639884.gal : 54 ms
[2026-05-25 04:29:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9816279475980180048.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15815065535293639884.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9816279475980180048.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9816279475980180048.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 153
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :153 after 153
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :153 after 153
SMT process timed out in 46312ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 479 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10153/10153 transitions.
Applied a total of 0 rules in 516 ms. Remains 2803 /2803 variables (removed 0) and now considering 10153/10153 (removed 0) transitions.
[2026-05-25 04:29:31] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :153 after 29893
[2026-05-25 04:29:35] [INFO ] Implicit Places using invariants in 3445 ms returned []
Implicit Place search using SMT only with invariants took 3446 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3963 ms. Remains : 2803/2803 places, 10153/10153 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9850 edges and 2803 vertex of which 2599 / 2803 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2597 places
Drop transitions (Empty/Sink Transition effects.) removed 7402 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9944 transitions.
Graph (complete) has 511 edges and 206 vertex of which 55 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 54 transition count 58
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 153 place count 6 transition count 10
Iterating global reduction 2 with 48 rules applied. Total rules applied 201 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 4 transition count 5
Applied a total of 207 rules in 17 ms. Remains 4 /2803 variables (removed 2799) and now considering 5/10153 (removed 10148) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15939213208981134758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-108222180685500545.kers'
[2026-05-25 04:29:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15939213208981134758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-108222180685500545.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 04:29:35] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-108222180685500545.kers
Total runtime 0 ms.
[2026-05-25 04:29:35] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-25 04:29:35] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 04:29:35] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:29:35] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:29:35] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:29:35] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:29:35] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:29:35] [INFO ] Flatten gal took : 0 ms
[2026-05-25 04:29:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3483105907360763973.gal : 0 ms
[2026-05-25 04:29:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16024933241003530504.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3483105907360763973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16024933241003530504.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16024933241003530504.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 702
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3876,0.008933,4184,2,57,12,685,7,0,23,660,0
Total reachable state count : 3876
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.009253,4320,2,5,12,685,7,0,25,660,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.009461,4412,2,5,12,685,8,0,27,660,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 92 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-15 in 141410 ms.
[2026-05-25 04:29:35] [INFO ] Flatten gal took : 121 ms
[2026-05-25 04:29:35] [INFO ] Applying decomposition
[2026-05-25 04:29:35] [INFO ] Flatten gal took : 128 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/graph8957349076693621441.txt' '-o' '/tmp/graph8957349076693621441.bin' '-w' '/tmp/graph8957349076693621441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8957349076693621441.bin' '-l' '-1' '-v' '-w' '/tmp/graph8957349076693621441.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:29:36] [INFO ] Decomposing Gal with order
[2026-05-25 04:29:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:29:36] [INFO ] Removed a total of 7676 redundant transitions.
[2026-05-25 04:29:36] [INFO ] Flatten gal took : 533 ms
[2026-05-25 04:29:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8726 labels/synchronizations in 479 ms.
[2026-05-25 04:29:37] [INFO ] Time to serialize gal into /tmp/UpperBounds2107713002342312961.gal : 51 ms
[2026-05-25 04:29:37] [INFO ] Time to serialize properties into /tmp/UpperBounds11028645107308250137.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2107713002342312961.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11028645107308250137.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds11028645107308250137.prop.
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 UpperBounds -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="CANInsertWithFailure-PT-050"
export BK_EXAMINATION="UpperBounds"
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 CANInsertWithFailure-PT-050, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842200741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-050.tgz
mv CANInsertWithFailure-PT-050 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;