About the Execution of ITS-Tools for CANInsertWithFailure-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16201.012 | 3600000.00 | 4362420.00 | 123514.00 | ? ? ? 1 1 ? ? 19 ? ? ? ? ? 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842100717.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-020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100717
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 6.3K Mar 6 09:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 6 09:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 6 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Mar 6 09:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 201K Mar 6 09:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 6 09:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 6 09:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 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 2.6M 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-020-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-020-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779667244004
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-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 00:00:45] [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 00:00:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:00:45] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2026-05-25 00:00:45] [INFO ] Transformed 1044 places.
[2026-05-25 00:00:45] [INFO ] Transformed 2520 transitions.
[2026-05-25 00:00:45] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 287 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-7328726882401466769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9505141534130914636.kers'
[2026-05-25 00:00:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7328726882401466769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9505141534130914636.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2520 rows 1043 cols 5200 entries
Finished phase 1 with 1001 SingleSign rule and 20 generalized
[2026-05-25 00:00:45] [INFO ] Computed 23 invariants in 18 ms
Computed 23 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-9505141534130914636.kers
Total runtime 21 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:[20, 20, 20, 20, 1, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1]
RANDOM walk for 10000 steps (21 resets) in 77 ms. (128 steps per ms)
FORMULA CANInsertWithFailure-PT-020-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-020-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-020-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-020-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (24 resets) in 143 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
[2026-05-25 00:00:45] [INFO ] Invariant cache hit.
[2026-05-25 00:00:46] [INFO ] [Real]Absence check using 21 positive place invariants in 25 ms returned sat
[2026-05-25 00:00:46] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 00:00:46] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2026-05-25 00:00:46] [INFO ] State equation strengthened by 780 read => feed constraints.
[2026-05-25 00:00:47] [INFO ] [Real]Added 780 Read/Feed constraints in 129 ms returned sat
[2026-05-25 00:00:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:00:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-05-25 00:00:47] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:00:47] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2026-05-25 00:00:48] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 00:00:48] [INFO ] [Nat]Added 780 Read/Feed constraints in 650 ms returned sat
[2026-05-25 00:00:48] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 148 ms.
[2026-05-25 00:00:49] [INFO ] Added : 55 causal constraints over 11 iterations in 1443 ms. Result :sat
Minimization took 598 ms.
[2026-05-25 00:00:50] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2026-05-25 00:00:50] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:00:51] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2026-05-25 00:00:51] [INFO ] [Real]Added 780 Read/Feed constraints in 106 ms returned sat
[2026-05-25 00:00:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:00:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:00:51] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-25 00:00:52] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2026-05-25 00:00:52] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 00:00:52] [INFO ] [Nat]Added 780 Read/Feed constraints in 724 ms returned sat
[2026-05-25 00:00:52] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 111 ms.
[2026-05-25 00:00:54] [INFO ] Added : 56 causal constraints over 12 iterations in 1414 ms. Result :sat
Minimization took 578 ms.
[2026-05-25 00:00:54] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2026-05-25 00:00:54] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:00:55] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2026-05-25 00:00:55] [INFO ] [Real]Added 780 Read/Feed constraints in 86 ms returned sat
[2026-05-25 00:00:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:00:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2026-05-25 00:00:55] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:00:56] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2026-05-25 00:00:56] [INFO ] [Nat]Added 780 Read/Feed constraints in 427 ms returned sat
[2026-05-25 00:00:56] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 116 ms.
[2026-05-25 00:00:57] [INFO ] Added : 29 causal constraints over 6 iterations in 802 ms. Result :sat
Minimization took 577 ms.
[2026-05-25 00:00:58] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:00:58] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:00:58] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2026-05-25 00:00:58] [INFO ] [Real]Added 780 Read/Feed constraints in 89 ms returned sat
[2026-05-25 00:00:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:00:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2026-05-25 00:00:59] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:00:59] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2026-05-25 00:00:59] [INFO ] [Nat]Added 780 Read/Feed constraints in 297 ms returned sat
[2026-05-25 00:01:00] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 119 ms.
[2026-05-25 00:01:01] [INFO ] Added : 37 causal constraints over 8 iterations in 1042 ms. Result :sat
Minimization took 582 ms.
[2026-05-25 00:01:01] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:01] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:01:02] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2026-05-25 00:01:02] [INFO ] [Real]Added 780 Read/Feed constraints in 164 ms returned sat
[2026-05-25 00:01:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2026-05-25 00:01:02] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:03] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2026-05-25 00:01:03] [INFO ] [Nat]Added 780 Read/Feed constraints in 460 ms returned sat
[2026-05-25 00:01:03] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 124 ms.
[2026-05-25 00:01:04] [INFO ] Added : 37 causal constraints over 8 iterations in 1012 ms. Result :sat
Minimization took 575 ms.
[2026-05-25 00:01:05] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2026-05-25 00:01:05] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:05] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2026-05-25 00:01:05] [INFO ] [Real]Added 780 Read/Feed constraints in 73 ms returned sat
[2026-05-25 00:01:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:06] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:01:06] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2026-05-25 00:01:06] [INFO ] [Nat]Added 780 Read/Feed constraints in 284 ms returned sat
[2026-05-25 00:01:07] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 115 ms.
[2026-05-25 00:01:08] [INFO ] Added : 60 causal constraints over 12 iterations in 1476 ms. Result :sat
Minimization took 575 ms.
[2026-05-25 00:01:09] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:09] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 00:01:09] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2026-05-25 00:01:10] [INFO ] [Real]Added 780 Read/Feed constraints in 185 ms returned sat
[2026-05-25 00:01:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2026-05-25 00:01:10] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:10] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2026-05-25 00:01:11] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 00:01:11] [INFO ] [Nat]Added 780 Read/Feed constraints in 945 ms returned sat
[2026-05-25 00:01:11] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 103 ms.
[2026-05-25 00:01:14] [INFO ] Added : 112 causal constraints over 23 iterations in 2326 ms. Result :sat
Minimization took 577 ms.
[2026-05-25 00:01:14] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2026-05-25 00:01:14] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:15] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2026-05-25 00:01:15] [INFO ] [Real]Added 780 Read/Feed constraints in 75 ms returned sat
[2026-05-25 00:01:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:15] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:16] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2026-05-25 00:01:16] [INFO ] [Nat]Added 780 Read/Feed constraints in 469 ms returned sat
[2026-05-25 00:01:16] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 98 ms.
[2026-05-25 00:01:18] [INFO ] Added : 63 causal constraints over 13 iterations in 1500 ms. Result :sat
Minimization took 574 ms.
[2026-05-25 00:01:18] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2026-05-25 00:01:18] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:01:19] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2026-05-25 00:01:19] [INFO ] [Real]Added 780 Read/Feed constraints in 71 ms returned sat
[2026-05-25 00:01:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:19] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:19] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2026-05-25 00:01:20] [INFO ] [Nat]Added 780 Read/Feed constraints in 439 ms returned sat
[2026-05-25 00:01:20] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 94 ms.
[2026-05-25 00:01:21] [INFO ] Added : 37 causal constraints over 8 iterations in 952 ms. Result :sat
Minimization took 576 ms.
[2026-05-25 00:01:22] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:22] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:22] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2026-05-25 00:01:22] [INFO ] [Real]Added 780 Read/Feed constraints in 61 ms returned sat
[2026-05-25 00:01:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:22] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:23] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2026-05-25 00:01:23] [INFO ] [Nat]Added 780 Read/Feed constraints in 423 ms returned sat
[2026-05-25 00:01:23] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 98 ms.
[2026-05-25 00:01:25] [INFO ] Added : 55 causal constraints over 11 iterations in 1308 ms. Result :sat
Minimization took 577 ms.
[2026-05-25 00:01:25] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:25] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:26] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2026-05-25 00:01:26] [INFO ] [Real]Added 780 Read/Feed constraints in 87 ms returned sat
[2026-05-25 00:01:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:26] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:01:27] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2026-05-25 00:01:27] [INFO ] [Nat]Added 780 Read/Feed constraints in 388 ms returned sat
[2026-05-25 00:01:27] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 104 ms.
[2026-05-25 00:01:29] [INFO ] Added : 73 causal constraints over 15 iterations in 1731 ms. Result :sat
Minimization took 577 ms.
[2026-05-25 00:01:30] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:30] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:30] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2026-05-25 00:01:30] [INFO ] [Real]Added 780 Read/Feed constraints in 75 ms returned sat
[2026-05-25 00:01:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-25 00:01:30] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:31] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2026-05-25 00:01:31] [INFO ] [Nat]Added 780 Read/Feed constraints in 386 ms returned sat
[2026-05-25 00:01:31] [INFO ] Computed and/alt/rep : 2440/3980/2440 causal constraints (skipped 60 transitions) in 109 ms.
[2026-05-25 00:01:33] [INFO ] Added : 47 causal constraints over 10 iterations in 1241 ms. Result :sat
Minimization took 579 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Support contains 12 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Graph (complete) has 3501 edges and 1044 vertex of which 1043 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 139 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 279 place count 904 transition count 2381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 279 place count 904 transition count 2380
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 281 place count 903 transition count 2380
Performed 320 Post agglomeration using F-continuation condition.Transition count delta: 320
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 921 place count 583 transition count 2060
Drop transitions (Redundant composition of simpler transitions.) removed 285 transitions
Redundant transition composition rules discarded 285 transitions
Iterating global reduction 3 with 285 rules applied. Total rules applied 1206 place count 583 transition count 1775
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1207 place count 583 transition count 1774
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1208 place count 582 transition count 1774
Partial Free-agglomeration rule applied 504 times.
Drop transitions (Partial Free agglomeration) removed 504 transitions
Iterating global reduction 4 with 504 rules applied. Total rules applied 1712 place count 582 transition count 1774
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 1735 place count 582 transition count 1774
Applied a total of 1735 rules in 439 ms. Remains 582 /1044 variables (removed 462) and now considering 1774/2520 (removed 746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 582/1044 places, 1774/2520 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10271893138457283860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13945229141098947987.kers'
[2026-05-25 00:01:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10271893138457283860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13945229141098947987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1774 rows 582 cols 3794 entries
Finished phase 1 with 540 SingleSign rule and 20 generalized
[2026-05-25 00:01:34] [INFO ] Computed 22 invariants in 8 ms
Computed 22 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-13945229141098947987.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
RANDOM walk for 1000000 steps (8835 resets) in 4526 ms. (220 steps per ms)
BEST_FIRST walk for 12000012 steps (4233 resets) in 8554 ms. (1402 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
[2026-05-25 00:01:47] [INFO ] Invariant cache hit.
[2026-05-25 00:01:47] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:01:47] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:47] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2026-05-25 00:01:47] [INFO ] State equation strengthened by 1585 read => feed constraints.
[2026-05-25 00:01:47] [INFO ] [Real]Added 1585 Read/Feed constraints in 129 ms returned sat
[2026-05-25 00:01:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:01:47] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:48] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2026-05-25 00:01:48] [INFO ] [Nat]Added 1585 Read/Feed constraints in 157 ms returned sat
[2026-05-25 00:01:48] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 71 ms.
[2026-05-25 00:01:48] [INFO ] Added : 9 causal constraints over 2 iterations in 353 ms. Result :sat
Minimization took 3985 ms.
[2026-05-25 00:01:52] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:01:52] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:53] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2026-05-25 00:01:53] [INFO ] [Real]Added 1585 Read/Feed constraints in 127 ms returned sat
[2026-05-25 00:01:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:01:53] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:53] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-25 00:01:53] [INFO ] [Nat]Added 1585 Read/Feed constraints in 157 ms returned sat
[2026-05-25 00:01:53] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 72 ms.
[2026-05-25 00:01:54] [INFO ] Added : 10 causal constraints over 2 iterations in 354 ms. Result :sat
Minimization took 3539 ms.
[2026-05-25 00:01:57] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:01:57] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:01:58] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:01:58] [INFO ] [Real]Added 1585 Read/Feed constraints in 147 ms returned sat
[2026-05-25 00:01:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:01:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:01:58] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:01:58] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-25 00:01:58] [INFO ] [Nat]Added 1585 Read/Feed constraints in 167 ms returned sat
[2026-05-25 00:01:58] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 72 ms.
[2026-05-25 00:01:59] [INFO ] Added : 6 causal constraints over 2 iterations in 339 ms. Result :sat
Minimization took 2971 ms.
[2026-05-25 00:02:02] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:02] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:02:02] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2026-05-25 00:02:02] [INFO ] [Real]Added 1585 Read/Feed constraints in 112 ms returned sat
[2026-05-25 00:02:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:02:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:02] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2026-05-25 00:02:03] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2026-05-25 00:02:03] [INFO ] [Nat]Added 1585 Read/Feed constraints in 185 ms returned sat
[2026-05-25 00:02:03] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 75 ms.
[2026-05-25 00:02:03] [INFO ] Added : 8 causal constraints over 2 iterations in 327 ms. Result :sat
Minimization took 3291 ms.
[2026-05-25 00:02:07] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:07] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:07] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2026-05-25 00:02:07] [INFO ] [Real]Added 1585 Read/Feed constraints in 126 ms returned sat
[2026-05-25 00:02:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:02:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:02:07] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:07] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2026-05-25 00:02:08] [INFO ] [Nat]Added 1585 Read/Feed constraints in 141 ms returned sat
[2026-05-25 00:02:08] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 76 ms.
[2026-05-25 00:02:08] [INFO ] Added : 9 causal constraints over 2 iterations in 342 ms. Result :sat
Minimization took 2801 ms.
[2026-05-25 00:02:11] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 00:02:11] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:11] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2026-05-25 00:02:11] [INFO ] [Real]Added 1585 Read/Feed constraints in 137 ms returned sat
[2026-05-25 00:02:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:02:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:02:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:02:12] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-25 00:02:12] [INFO ] [Nat]Added 1585 Read/Feed constraints in 133 ms returned sat
[2026-05-25 00:02:12] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 90 ms.
[2026-05-25 00:02:12] [INFO ] Added : 5 causal constraints over 1 iterations in 302 ms. Result :sat
Minimization took 2867 ms.
[2026-05-25 00:02:15] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:02:15] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:02:16] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2026-05-25 00:02:16] [INFO ] [Real]Added 1585 Read/Feed constraints in 135 ms returned sat
[2026-05-25 00:02:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:02:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2026-05-25 00:02:16] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:16] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2026-05-25 00:02:17] [INFO ] [Nat]Added 1585 Read/Feed constraints in 596 ms returned sat
[2026-05-25 00:02:17] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 74 ms.
[2026-05-25 00:02:17] [INFO ] Added : 16 causal constraints over 4 iterations in 547 ms. Result :sat
Minimization took 2702 ms.
[2026-05-25 00:02:20] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:20] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2026-05-25 00:02:21] [INFO ] [Real]Added 1585 Read/Feed constraints in 123 ms returned sat
[2026-05-25 00:02:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:02:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:21] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:02:21] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2026-05-25 00:02:21] [INFO ] [Nat]Added 1585 Read/Feed constraints in 127 ms returned sat
[2026-05-25 00:02:21] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 69 ms.
[2026-05-25 00:02:21] [INFO ] Added : 12 causal constraints over 3 iterations in 399 ms. Result :sat
Minimization took 3582 ms.
[2026-05-25 00:02:25] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:25] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:25] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2026-05-25 00:02:26] [INFO ] [Real]Added 1585 Read/Feed constraints in 141 ms returned sat
[2026-05-25 00:02:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:02:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:26] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:26] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2026-05-25 00:02:26] [INFO ] [Nat]Added 1585 Read/Feed constraints in 170 ms returned sat
[2026-05-25 00:02:26] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 75 ms.
[2026-05-25 00:02:27] [INFO ] Added : 10 causal constraints over 2 iterations in 343 ms. Result :sat
Minimization took 3406 ms.
[2026-05-25 00:02:30] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:02:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 00:02:30] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2026-05-25 00:02:31] [INFO ] [Real]Added 1585 Read/Feed constraints in 117 ms returned sat
[2026-05-25 00:02:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:02:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:31] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:31] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2026-05-25 00:02:31] [INFO ] [Nat]Added 1585 Read/Feed constraints in 174 ms returned sat
[2026-05-25 00:02:31] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 75 ms.
[2026-05-25 00:02:32] [INFO ] Added : 9 causal constraints over 2 iterations in 376 ms. Result :sat
Minimization took 2569 ms.
[2026-05-25 00:02:34] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:02:34] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:34] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:02:35] [INFO ] [Real]Added 1585 Read/Feed constraints in 110 ms returned sat
[2026-05-25 00:02:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:02:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:35] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:35] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:02:35] [INFO ] [Nat]Added 1585 Read/Feed constraints in 213 ms returned sat
[2026-05-25 00:02:35] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 77 ms.
[2026-05-25 00:02:36] [INFO ] Added : 9 causal constraints over 2 iterations in 339 ms. Result :sat
Minimization took 4046 ms.
[2026-05-25 00:02:40] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:40] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:02:40] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2026-05-25 00:02:40] [INFO ] [Real]Added 1585 Read/Feed constraints in 121 ms returned sat
[2026-05-25 00:02:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:02:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:02:40] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:02:41] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2026-05-25 00:02:41] [INFO ] [Nat]Added 1585 Read/Feed constraints in 204 ms returned sat
[2026-05-25 00:02:41] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 70 ms.
[2026-05-25 00:02:41] [INFO ] Added : 8 causal constraints over 2 iterations in 342 ms. Result :sat
Minimization took 3355 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Support contains 12 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1774/1774 transitions.
Applied a total of 0 rules in 27 ms. Remains 582 /582 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 582/582 places, 1774/1774 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1774/1774 transitions.
Applied a total of 0 rules in 27 ms. Remains 582 /582 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
[2026-05-25 00:02:45] [INFO ] Invariant cache hit.
[2026-05-25 00:02:45] [INFO ] Implicit Places using invariants in 393 ms returned []
[2026-05-25 00:02:45] [INFO ] Invariant cache hit.
[2026-05-25 00:02:46] [INFO ] State equation strengthened by 1585 read => feed constraints.
[2026-05-25 00:02:56] [INFO ] Implicit Places using invariants and state equation in 10827 ms returned []
Implicit Place search using SMT with State Equation took 11223 ms to find 0 implicit places.
[2026-05-25 00:02:56] [INFO ] Redundant transitions in 172 ms returned []
Running 1754 sub problems to find dead transitions.
[2026-05-25 00:02:56] [INFO ] Invariant cache hit.
[2026-05-25 00:02:56] [INFO ] State equation strengthened by 1585 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/2356 variables, and 62 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1585 constraints, PredecessorRefiner: 1754/1754 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/2356 variables, and 242 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1585 constraints, PredecessorRefiner: 0/1754 constraints, Known Traps: 220/220 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60661ms problems are : Problem set: 0 solved, 1754 unsolved
Search for dead transitions found 0 dead transitions in 60686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72162 ms. Remains : 582/582 places, 1774/1774 transitions.
[2026-05-25 00:03:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
RANDOM walk for 1000000 steps (8857 resets) in 4459 ms. (224 steps per ms)
BEST_FIRST walk for 12000012 steps (4247 resets) in 8477 ms. (1415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
[2026-05-25 00:04:10] [INFO ] Invariant cache hit.
[2026-05-25 00:04:10] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:04:10] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2026-05-25 00:04:10] [INFO ] State equation strengthened by 1585 read => feed constraints.
[2026-05-25 00:04:10] [INFO ] [Real]Added 1585 Read/Feed constraints in 144 ms returned sat
[2026-05-25 00:04:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:04:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:11] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:04:11] [INFO ] [Nat]Added 1585 Read/Feed constraints in 137 ms returned sat
[2026-05-25 00:04:11] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 73 ms.
[2026-05-25 00:04:11] [INFO ] Added : 9 causal constraints over 2 iterations in 342 ms. Result :sat
Minimization took 3934 ms.
[2026-05-25 00:04:15] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:15] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:16] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2026-05-25 00:04:16] [INFO ] [Real]Added 1585 Read/Feed constraints in 127 ms returned sat
[2026-05-25 00:04:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:04:16] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:16] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2026-05-25 00:04:16] [INFO ] [Nat]Added 1585 Read/Feed constraints in 157 ms returned sat
[2026-05-25 00:04:16] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 70 ms.
[2026-05-25 00:04:17] [INFO ] Added : 10 causal constraints over 2 iterations in 356 ms. Result :sat
Minimization took 3492 ms.
[2026-05-25 00:04:20] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:21] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2026-05-25 00:04:21] [INFO ] [Real]Added 1585 Read/Feed constraints in 142 ms returned sat
[2026-05-25 00:04:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:21] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:04:21] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2026-05-25 00:04:21] [INFO ] [Nat]Added 1585 Read/Feed constraints in 166 ms returned sat
[2026-05-25 00:04:21] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 70 ms.
[2026-05-25 00:04:22] [INFO ] Added : 6 causal constraints over 2 iterations in 335 ms. Result :sat
Minimization took 2978 ms.
[2026-05-25 00:04:25] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:25] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:25] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2026-05-25 00:04:25] [INFO ] [Real]Added 1585 Read/Feed constraints in 116 ms returned sat
[2026-05-25 00:04:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:04:25] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:26] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2026-05-25 00:04:26] [INFO ] [Nat]Added 1585 Read/Feed constraints in 187 ms returned sat
[2026-05-25 00:04:26] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 70 ms.
[2026-05-25 00:04:26] [INFO ] Added : 8 causal constraints over 2 iterations in 334 ms. Result :sat
Minimization took 3340 ms.
[2026-05-25 00:04:30] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:04:30] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:04:30] [INFO ] [Real]Added 1585 Read/Feed constraints in 138 ms returned sat
[2026-05-25 00:04:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:04:30] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:30] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:04:31] [INFO ] [Nat]Added 1585 Read/Feed constraints in 144 ms returned sat
[2026-05-25 00:04:31] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 75 ms.
[2026-05-25 00:04:31] [INFO ] Added : 9 causal constraints over 2 iterations in 333 ms. Result :sat
Minimization took 2849 ms.
[2026-05-25 00:04:34] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:34] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:34] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2026-05-25 00:04:34] [INFO ] [Real]Added 1585 Read/Feed constraints in 132 ms returned sat
[2026-05-25 00:04:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:35] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:35] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2026-05-25 00:04:35] [INFO ] [Nat]Added 1585 Read/Feed constraints in 139 ms returned sat
[2026-05-25 00:04:35] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 76 ms.
[2026-05-25 00:04:35] [INFO ] Added : 5 causal constraints over 1 iterations in 286 ms. Result :sat
Minimization took 2841 ms.
[2026-05-25 00:04:38] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:04:38] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:39] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2026-05-25 00:04:39] [INFO ] [Real]Added 1585 Read/Feed constraints in 104 ms returned unsat
[2026-05-25 00:04:39] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:39] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:39] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2026-05-25 00:04:39] [INFO ] [Real]Added 1585 Read/Feed constraints in 127 ms returned sat
[2026-05-25 00:04:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:39] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:40] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2026-05-25 00:04:40] [INFO ] [Nat]Added 1585 Read/Feed constraints in 124 ms returned sat
[2026-05-25 00:04:40] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 79 ms.
[2026-05-25 00:04:40] [INFO ] Added : 12 causal constraints over 3 iterations in 426 ms. Result :sat
Minimization took 3681 ms.
[2026-05-25 00:04:44] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:44] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:44] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2026-05-25 00:04:44] [INFO ] [Real]Added 1585 Read/Feed constraints in 145 ms returned sat
[2026-05-25 00:04:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:04:45] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:45] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2026-05-25 00:04:45] [INFO ] [Nat]Added 1585 Read/Feed constraints in 181 ms returned sat
[2026-05-25 00:04:45] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 81 ms.
[2026-05-25 00:04:45] [INFO ] Added : 10 causal constraints over 2 iterations in 368 ms. Result :sat
Minimization took 3564 ms.
[2026-05-25 00:04:49] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:49] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:49] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:04:50] [INFO ] [Real]Added 1585 Read/Feed constraints in 118 ms returned sat
[2026-05-25 00:04:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:50] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:50] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2026-05-25 00:04:50] [INFO ] [Nat]Added 1585 Read/Feed constraints in 159 ms returned sat
[2026-05-25 00:04:50] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 77 ms.
[2026-05-25 00:04:50] [INFO ] Added : 9 causal constraints over 2 iterations in 370 ms. Result :sat
Minimization took 2686 ms.
[2026-05-25 00:04:53] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:53] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:04:54] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:04:54] [INFO ] [Real]Added 1585 Read/Feed constraints in 108 ms returned sat
[2026-05-25 00:04:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 00:04:54] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:04:54] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2026-05-25 00:04:54] [INFO ] [Nat]Added 1585 Read/Feed constraints in 214 ms returned sat
[2026-05-25 00:04:54] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 73 ms.
[2026-05-25 00:04:55] [INFO ] Added : 9 causal constraints over 2 iterations in 333 ms. Result :sat
Minimization took 4065 ms.
[2026-05-25 00:04:59] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:59] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:04:59] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2026-05-25 00:04:59] [INFO ] [Real]Added 1585 Read/Feed constraints in 119 ms returned sat
[2026-05-25 00:04:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:04:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:04:59] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:00] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2026-05-25 00:05:00] [INFO ] [Nat]Added 1585 Read/Feed constraints in 199 ms returned sat
[2026-05-25 00:05:00] [INFO ] Computed and/alt/rep : 1264/3703/1264 causal constraints (skipped 490 transitions) in 72 ms.
[2026-05-25 00:05:00] [INFO ] Added : 8 causal constraints over 2 iterations in 339 ms. Result :sat
Minimization took 3338 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 19, 20, 20, 20, 20, 20]
FORMULA CANInsertWithFailure-PT-020-UpperBounds-07 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Support contains 11 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1774/1774 transitions.
Partial Free-agglomeration rule applied 55 times.
Drop transitions (Partial Free agglomeration) removed 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 55 place count 582 transition count 1774
Applied a total of 55 rules in 51 ms. Remains 582 /582 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 582/582 places, 1774/1774 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13697120448022251537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16352676619323882216.kers'
[2026-05-25 00:05:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13697120448022251537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16352676619323882216.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1774 rows 582 cols 3794 entries
Finished phase 1 with 540 SingleSign rule and 20 generalized
[2026-05-25 00:05:04] [INFO ] Computed 22 invariants in 8 ms
Computed 22 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16352676619323882216.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
RANDOM walk for 1000000 steps (8979 resets) in 4519 ms. (221 steps per ms)
BEST_FIRST walk for 11000011 steps (4458 resets) in 7937 ms. (1385 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
[2026-05-25 00:05:16] [INFO ] Invariant cache hit.
[2026-05-25 00:05:16] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:05:16] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:05:17] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2026-05-25 00:05:17] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:05:17] [INFO ] [Real]Added 1640 Read/Feed constraints in 161 ms returned sat
[2026-05-25 00:05:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:05:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:05:17] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:17] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2026-05-25 00:05:17] [INFO ] [Nat]Added 1640 Read/Feed constraints in 163 ms returned sat
[2026-05-25 00:05:18] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 73 ms.
[2026-05-25 00:05:18] [INFO ] Added : 11 causal constraints over 3 iterations in 415 ms. Result :sat
Minimization took 3776 ms.
[2026-05-25 00:05:22] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:05:22] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:22] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2026-05-25 00:05:22] [INFO ] [Real]Added 1640 Read/Feed constraints in 157 ms returned sat
[2026-05-25 00:05:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:05:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:05:22] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:23] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2026-05-25 00:05:23] [INFO ] [Nat]Added 1640 Read/Feed constraints in 149 ms returned sat
[2026-05-25 00:05:23] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 83 ms.
[2026-05-25 00:05:23] [INFO ] Added : 7 causal constraints over 2 iterations in 365 ms. Result :sat
Minimization took 4504 ms.
[2026-05-25 00:05:28] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:05:28] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:28] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2026-05-25 00:05:28] [INFO ] [Real]Added 1640 Read/Feed constraints in 155 ms returned sat
[2026-05-25 00:05:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:05:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:05:28] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:29] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:05:29] [INFO ] [Nat]Added 1640 Read/Feed constraints in 146 ms returned sat
[2026-05-25 00:05:29] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 72 ms.
[2026-05-25 00:05:29] [INFO ] Added : 11 causal constraints over 3 iterations in 412 ms. Result :sat
Minimization took 4503 ms.
[2026-05-25 00:05:34] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:05:34] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-25 00:05:34] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2026-05-25 00:05:34] [INFO ] [Real]Added 1640 Read/Feed constraints in 116 ms returned sat
[2026-05-25 00:05:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:05:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:05:34] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:35] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2026-05-25 00:05:35] [INFO ] [Nat]Added 1640 Read/Feed constraints in 205 ms returned sat
[2026-05-25 00:05:35] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 77 ms.
[2026-05-25 00:05:35] [INFO ] Added : 10 causal constraints over 2 iterations in 336 ms. Result :sat
Minimization took 4032 ms.
[2026-05-25 00:05:39] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:05:39] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:05:40] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2026-05-25 00:05:40] [INFO ] [Real]Added 1640 Read/Feed constraints in 162 ms returned sat
[2026-05-25 00:05:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:05:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 00:05:40] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:05:40] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2026-05-25 00:05:40] [INFO ] [Nat]Added 1640 Read/Feed constraints in 180 ms returned sat
[2026-05-25 00:05:40] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 74 ms.
[2026-05-25 00:05:41] [INFO ] Added : 8 causal constraints over 2 iterations in 364 ms. Result :sat
Minimization took 3808 ms.
[2026-05-25 00:05:45] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:05:45] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:45] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2026-05-25 00:05:45] [INFO ] [Real]Added 1640 Read/Feed constraints in 182 ms returned sat
[2026-05-25 00:05:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:05:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:05:45] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:46] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2026-05-25 00:05:46] [INFO ] [Nat]Added 1640 Read/Feed constraints in 130 ms returned sat
[2026-05-25 00:05:46] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 73 ms.
[2026-05-25 00:05:46] [INFO ] Added : 5 causal constraints over 1 iterations in 278 ms. Result :sat
Minimization took 2978 ms.
[2026-05-25 00:05:49] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:05:49] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:05:49] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:05:50] [INFO ] [Real]Added 1640 Read/Feed constraints in 143 ms returned sat
[2026-05-25 00:05:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:05:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:05:50] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:50] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2026-05-25 00:05:50] [INFO ] [Nat]Added 1640 Read/Feed constraints in 142 ms returned sat
[2026-05-25 00:05:50] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 77 ms.
[2026-05-25 00:05:51] [INFO ] Added : 10 causal constraints over 2 iterations in 365 ms. Result :sat
Minimization took 4320 ms.
[2026-05-25 00:05:55] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:05:55] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:05:55] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2026-05-25 00:05:55] [INFO ] [Real]Added 1640 Read/Feed constraints in 136 ms returned sat
[2026-05-25 00:05:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:05:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:05:56] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:05:56] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2026-05-25 00:05:56] [INFO ] [Nat]Added 1640 Read/Feed constraints in 141 ms returned sat
[2026-05-25 00:05:56] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 73 ms.
[2026-05-25 00:05:56] [INFO ] Added : 8 causal constraints over 2 iterations in 351 ms. Result :sat
Minimization took 3610 ms.
[2026-05-25 00:06:00] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:06:00] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:06:00] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:06:01] [INFO ] [Real]Added 1640 Read/Feed constraints in 149 ms returned sat
[2026-05-25 00:06:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:06:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:06:01] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:06:01] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2026-05-25 00:06:01] [INFO ] [Nat]Added 1640 Read/Feed constraints in 140 ms returned sat
[2026-05-25 00:06:01] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 72 ms.
[2026-05-25 00:06:01] [INFO ] Added : 7 causal constraints over 2 iterations in 341 ms. Result :sat
Minimization took 4505 ms.
[2026-05-25 00:06:06] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:06:06] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:06:06] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2026-05-25 00:06:06] [INFO ] [Real]Added 1640 Read/Feed constraints in 122 ms returned sat
[2026-05-25 00:06:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:06:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:06:07] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:06:07] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2026-05-25 00:06:07] [INFO ] [Nat]Added 1640 Read/Feed constraints in 185 ms returned sat
[2026-05-25 00:06:07] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 76 ms.
[2026-05-25 00:06:07] [INFO ] Added : 7 causal constraints over 2 iterations in 364 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 00:06:12] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:06:12] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:06:12] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2026-05-25 00:06:13] [INFO ] [Real]Added 1640 Read/Feed constraints in 147 ms returned sat
[2026-05-25 00:06:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:06:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 00:06:13] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:06:13] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2026-05-25 00:06:13] [INFO ] [Nat]Added 1640 Read/Feed constraints in 240 ms returned sat
[2026-05-25 00:06:13] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 71 ms.
[2026-05-25 00:06:14] [INFO ] Added : 6 causal constraints over 2 iterations in 364 ms. Result :sat
Minimization took 3528 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
Support contains 11 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1774/1774 transitions.
Applied a total of 0 rules in 23 ms. Remains 582 /582 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 582/582 places, 1774/1774 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1774/1774 transitions.
Applied a total of 0 rules in 23 ms. Remains 582 /582 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
[2026-05-25 00:06:17] [INFO ] Invariant cache hit.
[2026-05-25 00:06:18] [INFO ] Implicit Places using invariants in 441 ms returned []
[2026-05-25 00:06:18] [INFO ] Invariant cache hit.
[2026-05-25 00:06:18] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:06:28] [INFO ] Implicit Places using invariants and state equation in 10044 ms returned []
Implicit Place search using SMT with State Equation took 10487 ms to find 0 implicit places.
[2026-05-25 00:06:28] [INFO ] Redundant transitions in 34 ms returned []
Running 1754 sub problems to find dead transitions.
[2026-05-25 00:06:28] [INFO ] Invariant cache hit.
[2026-05-25 00:06:28] [INFO ] State equation strengthened by 1640 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/2356 variables, and 62 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1640 constraints, PredecessorRefiner: 1754/1754 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/2356 variables, and 236 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1640 constraints, PredecessorRefiner: 0/1754 constraints, Known Traps: 214/214 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60524ms problems are : Problem set: 0 solved, 1754 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71081 ms. Remains : 582/582 places, 1774/1774 transitions.
RANDOM walk for 40000 steps (359 resets) in 1490 ms. (26 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
[2026-05-25 00:07:29] [INFO ] Flatten gal took : 218 ms
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
[2026-05-25 00:07:29] [INFO ] Flatten gal took : 86 ms
[2026-05-25 00:07:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8926994773824548546.gal : 47 ms
[2026-05-25 00:07:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8379846571207426923.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/ReachabilityCardinality8926994773824548546.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8379846571207426923.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/ReachabilityCardinality8379846571207426923.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :24 after 25
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :25 after 26
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :26 after 28
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :28 after 31
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :31 after 49
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :49 after 313
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :313 after 367
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :367 after 389
Interrupted probabilistic random walk after 272945 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 22
Probabilistic random walk after 272945 steps, saw 40897 distinct states, run finished after 3005 ms. (steps per millisecond=90 ) properties seen :0
[2026-05-25 00:07:32] [INFO ] Invariant cache hit.
[2026-05-25 00:07:32] [INFO ] State equation strengthened by 1640 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 529/540 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 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
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 19/20 constraints. Problems are: Problem set: 11 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/20 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 38/578 variables, 19/39 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 0/39 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/580 variables, 2/41 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/41 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1774/2354 variables, 580/621 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2354 variables, 1640/2261 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2354 variables, 0/2261 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 2/2356 variables, 2/2263 constraints. Problems are: Problem set: 11 solved, 11 unsolved
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :389 after 4082
At refinement iteration 12 (INCLUDED_ONLY) 0/2356 variables, 0/2263 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/2356 variables, 0/2263 constraints. Problems are: Problem set: 11 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2356/2356 variables, and 2263 constraints, problems are : Problem set: 11 solved, 11 unsolved in 4332 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 582/582 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 529/540 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 19/20 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/20 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 38/578 variables, 19/39 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 0/39 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/580 variables, 2/41 constraints. Problems are: Problem set: 11 solved, 11 unsolved
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :4082 after 4869
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 15/56 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 1/57 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 0/57 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1774/2354 variables, 580/637 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2354 variables, 1640/2277 constraints. Problems are: Problem set: 11 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2354/2356 variables, and 2288 constraints, problems are : Problem set: 11 solved, 11 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 580/582 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 11/22 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9367ms problems are : Problem set: 11 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1774/1774 transitions.
Applied a total of 0 rules in 25 ms. Remains 582 /582 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 582/582 places, 1774/1774 transitions.
RANDOM walk for 40000 steps (353 resets) in 687 ms. (58 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (15 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (15 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (15 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (14 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (16 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (14 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (13 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (14 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (15 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (16 resets) in 72 ms. (548 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 345507 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 11
Probabilistic random walk after 345507 steps, saw 49732 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2026-05-25 00:07:45] [INFO ] Invariant cache hit.
[2026-05-25 00:07:45] [INFO ] State equation strengthened by 1640 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 529/540 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/578 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/580 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1774/2354 variables, 580/602 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2354 variables, 1640/2242 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2354 variables, 0/2242 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 2/2356 variables, 2/2244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2356 variables, 0/2244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/2356 variables, 0/2244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2356/2356 variables, and 2244 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3008 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 582/582 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 529/540 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 38/578 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/580 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :4869 after 6322
At refinement iteration 9 (OVERLAPS) 1774/2354 variables, 580/625 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2354 variables, 1640/2265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MIN3 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/2354 variables, 11/2276 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2354 variables, 0/2276 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/2356 variables, 2/2278 constraints. Problems are: Problem set: 1 solved, 10 unsolved
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :6322 after 36421
At refinement iteration 14 (INCLUDED_ONLY) 0/2356 variables, 0/2278 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/2356 variables, 0/2278 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2356/2356 variables, and 2278 constraints, problems are : Problem set: 1 solved, 10 unsolved in 23986 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 582/582 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27016ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 983 ms.
Support contains 10 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1774/1774 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 581 transition count 1773
Applied a total of 2 rules in 47 ms. Remains 581 /582 variables (removed 1) and now considering 1773/1774 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 581/582 places, 1773/1774 transitions.
RANDOM walk for 40000 steps (358 resets) in 477 ms. (83 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 367852 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 10
Probabilistic random walk after 367852 steps, saw 47987 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18351106920483288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18229412143104157313.kers'
[2026-05-25 00:08:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18351106920483288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18229412143104157313.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:08:16] [INFO ] Computed 22 invariants in 8 ms
Computed 22 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-18229412143104157313.kers
Total runtime 9 ms.
[2026-05-25 00:08:16] [INFO ] State equation strengthened by 1640 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/577 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/579 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1773/2352 variables, 579/601 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2352 variables, 1640/2241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2352 variables, 0/2241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/2354 variables, 2/2243 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2354 variables, 0/2243 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Detected timeout of ITS tools.
[2026-05-25 00:08:19] [INFO ] Flatten gal took : 53 ms
[2026-05-25 00:08:19] [INFO ] Applying decomposition
[2026-05-25 00:08:19] [INFO ] Flatten gal took : 45 ms
At refinement iteration 12 (OVERLAPS) 0/2354 variables, 0/2243 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
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/graph11690782403150684020.txt' '-o' '/tmp/graph11690782403150684020.bin' '-w' '/tmp/graph11690782403150684020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11690782403150684020.bin' '-l' '-1' '-v' '-w' '/tmp/graph11690782403150684020.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:08:19] [INFO ] Decomposing Gal with order
[2026-05-25 00:08:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:08:20] [INFO ] Removed a total of 1312 redundant transitions.
After SMT solving in domain Real declared 2354/2354 variables, and 2243 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3666 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 581/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
[2026-05-25 00:08:20] [INFO ] Flatten gal took : 265 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2026-05-25 00:08:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 1228 labels/synchronizations in 74 ms.
[2026-05-25 00:08:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9775057283963180139.gal : 19 ms
[2026-05-25 00:08:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7576486935683928757.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/ReachabilityCardinality9775057283963180139.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7576486935683928757.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
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality7576486935683928757.prop.
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 38/577 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 112
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :112 after 112
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :112 after 112
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :112 after 112
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :112 after 120
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :120 after 129
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :129 after 134
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :134 after 380
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/579 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :380 after 10804
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :10804 after 326764
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :326764 after 693500
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1773/2352 variables, 579/618 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2352 variables, 1640/2258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2352 variables, 10/2268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :693500 after 8.99824e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/2352 variables, 0/2268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/2354 variables, 2/2270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2354 variables, 0/2270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/2354 variables, 0/2270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2354/2354 variables, and 2270 constraints, problems are : Problem set: 0 solved, 10 unsolved in 29507 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 581/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33205ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 57 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 581/581 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 57 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2026-05-25 00:08:49] [INFO ] Invariant cache hit.
[2026-05-25 00:08:50] [INFO ] Implicit Places using invariants in 880 ms returned []
[2026-05-25 00:08:50] [INFO ] Invariant cache hit.
[2026-05-25 00:08:51] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:09:02] [INFO ] Implicit Places using invariants and state equation in 11724 ms returned []
Implicit Place search using SMT with State Equation took 12605 ms to find 0 implicit places.
[2026-05-25 00:09:02] [INFO ] Redundant transitions in 137 ms returned []
Running 1753 sub problems to find dead transitions.
[2026-05-25 00:09:02] [INFO ] Invariant cache hit.
[2026-05-25 00:09:02] [INFO ] State equation strengthened by 1640 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :8.99824e+06 after 8.53052e+07
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/2354 variables, and 62 constraints, problems are : Problem set: 0 solved, 1753 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1640 constraints, PredecessorRefiner: 1753/1753 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1753 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1753 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/2354 variables, and 247 constraints, problems are : Problem set: 0 solved, 1753 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1640 constraints, PredecessorRefiner: 0/1753 constraints, Known Traps: 225/225 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60503ms problems are : Problem set: 0 solved, 1753 unsolved
Search for dead transitions found 0 dead transitions in 60508ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73326 ms. Remains : 581/581 places, 1773/1773 transitions.
FORMULA CANInsertWithFailure-PT-020-UpperBounds-03 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[19, 19, 19, 19, 19, 19, 19, 19, 19, 19]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15997256274602085001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15710821205699375028.kers'
[2026-05-25 00:10:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15997256274602085001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15710821205699375028.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1774 rows 582 cols 3794 entries
Finished phase 1 with 540 SingleSign rule and 20 generalized
[2026-05-25 00:10:03] [INFO ] Computed 22 invariants in 14 ms
Computed 22 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-15710821205699375028.kers
Total runtime 16 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[19, 19, 19, 19, 19, 19, 19, 19, 19, 19]
RANDOM walk for 1000000 steps (8988 resets) in 4567 ms. (218 steps per ms)
BEST_FIRST walk for 10000010 steps (4145 resets) in 7251 ms. (1378 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[19, 19, 19, 19, 19, 19, 19, 19, 19, 19]
[2026-05-25 00:10:15] [INFO ] Invariant cache hit.
[2026-05-25 00:10:15] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:10:15] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:15] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2026-05-25 00:10:15] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:10:15] [INFO ] [Real]Added 1640 Read/Feed constraints in 182 ms returned sat
[2026-05-25 00:10:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:15] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:10:16] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:10:16] [INFO ] [Nat]Added 1640 Read/Feed constraints in 160 ms returned sat
[2026-05-25 00:10:16] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 71 ms.
[2026-05-25 00:10:16] [INFO ] Added : 11 causal constraints over 3 iterations in 413 ms. Result :sat
Minimization took 3789 ms.
[2026-05-25 00:10:20] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:10:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:20] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2026-05-25 00:10:21] [INFO ] [Real]Added 1640 Read/Feed constraints in 154 ms returned sat
[2026-05-25 00:10:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:21] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:21] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2026-05-25 00:10:21] [INFO ] [Nat]Added 1640 Read/Feed constraints in 154 ms returned sat
[2026-05-25 00:10:21] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 71 ms.
[2026-05-25 00:10:21] [INFO ] Added : 7 causal constraints over 2 iterations in 351 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 00:10:26] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:26] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:26] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2026-05-25 00:10:27] [INFO ] [Real]Added 1640 Read/Feed constraints in 152 ms returned sat
[2026-05-25 00:10:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:27] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:27] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:10:27] [INFO ] [Nat]Added 1640 Read/Feed constraints in 139 ms returned sat
[2026-05-25 00:10:27] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 78 ms.
[2026-05-25 00:10:28] [INFO ] Added : 11 causal constraints over 3 iterations in 421 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 00:10:32] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:32] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:32] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2026-05-25 00:10:33] [INFO ] [Real]Added 1640 Read/Feed constraints in 168 ms returned sat
[2026-05-25 00:10:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:10:33] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:10:33] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2026-05-25 00:10:33] [INFO ] [Nat]Added 1640 Read/Feed constraints in 180 ms returned sat
[2026-05-25 00:10:33] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 73 ms.
[2026-05-25 00:10:34] [INFO ] Added : 8 causal constraints over 2 iterations in 360 ms. Result :sat
Minimization took 3863 ms.
[2026-05-25 00:10:38] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:38] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:38] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:10:38] [INFO ] [Real]Added 1640 Read/Feed constraints in 193 ms returned sat
[2026-05-25 00:10:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:38] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:10:39] [INFO ] [Nat]Added 1640 Read/Feed constraints in 137 ms returned sat
[2026-05-25 00:10:39] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 77 ms.
[2026-05-25 00:10:39] [INFO ] Added : 5 causal constraints over 1 iterations in 276 ms. Result :sat
Minimization took 3023 ms.
[2026-05-25 00:10:42] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:10:42] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:10:42] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2026-05-25 00:10:42] [INFO ] [Real]Added 1640 Read/Feed constraints in 146 ms returned sat
[2026-05-25 00:10:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:10:43] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:43] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2026-05-25 00:10:43] [INFO ] [Nat]Added 1640 Read/Feed constraints in 142 ms returned sat
[2026-05-25 00:10:43] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 75 ms.
[2026-05-25 00:10:43] [INFO ] Added : 10 causal constraints over 2 iterations in 357 ms. Result :sat
Minimization took 4334 ms.
[2026-05-25 00:10:48] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:48] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:48] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2026-05-25 00:10:48] [INFO ] [Real]Added 1640 Read/Feed constraints in 138 ms returned sat
[2026-05-25 00:10:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 00:10:48] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:49] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-25 00:10:49] [INFO ] [Nat]Added 1640 Read/Feed constraints in 138 ms returned sat
[2026-05-25 00:10:49] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 77 ms.
[2026-05-25 00:10:49] [INFO ] Added : 8 causal constraints over 2 iterations in 360 ms. Result :sat
Minimization took 3648 ms.
[2026-05-25 00:10:53] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:53] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:10:53] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2026-05-25 00:10:53] [INFO ] [Real]Added 1640 Read/Feed constraints in 145 ms returned sat
[2026-05-25 00:10:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:54] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:54] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2026-05-25 00:10:54] [INFO ] [Nat]Added 1640 Read/Feed constraints in 138 ms returned sat
[2026-05-25 00:10:54] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 82 ms.
[2026-05-25 00:10:54] [INFO ] Added : 7 causal constraints over 2 iterations in 344 ms. Result :sat
Minimization took 4502 ms.
[2026-05-25 00:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:10:59] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:59] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2026-05-25 00:10:59] [INFO ] [Real]Added 1640 Read/Feed constraints in 118 ms returned sat
[2026-05-25 00:10:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:00] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:00] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2026-05-25 00:11:00] [INFO ] [Nat]Added 1640 Read/Feed constraints in 181 ms returned sat
[2026-05-25 00:11:00] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 70 ms.
[2026-05-25 00:11:00] [INFO ] Added : 7 causal constraints over 2 iterations in 377 ms. Result :sat
Minimization took 4501 ms.
[2026-05-25 00:11:05] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:11:05] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:05] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2026-05-25 00:11:05] [INFO ] [Real]Added 1640 Read/Feed constraints in 148 ms returned sat
[2026-05-25 00:11:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:06] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:06] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2026-05-25 00:11:06] [INFO ] [Nat]Added 1640 Read/Feed constraints in 242 ms returned sat
[2026-05-25 00:11:06] [INFO ] Computed and/alt/rep : 1247/3672/1247 causal constraints (skipped 507 transitions) in 74 ms.
[2026-05-25 00:11:06] [INFO ] Added : 6 causal constraints over 2 iterations in 377 ms. Result :sat
Minimization took 3570 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[19, 19, 19, 19, 19, 19, 19, 19, 19, 19]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[19, 19, 19, 19, 19, 19, 19, 19, 19, 19]
Support contains 10 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1774/1774 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 581 transition count 1773
Applied a total of 2 rules in 33 ms. Remains 581 /582 variables (removed 1) and now considering 1773/1774 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 581/582 places, 1773/1774 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6973579764389995020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1807417053481857043.kers'
[2026-05-25 00:11:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6973579764389995020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1807417053481857043.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:11:10] [INFO ] Computed 22 invariants in 12 ms
Computed 22 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-1807417053481857043.kers
Total runtime 13 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[19, 19, 19, 19, 19, 19, 19, 19, 19, 19]
RANDOM walk for 1000000 steps (9042 resets) in 4476 ms. (223 steps per ms)
BEST_FIRST walk for 10000009 steps (4174 resets) in 7266 ms. (1376 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[19, 19, 19, 19, 19, 19, 19, 19, 19, 19]
[2026-05-25 00:11:22] [INFO ] Invariant cache hit.
[2026-05-25 00:11:22] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:22] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:22] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2026-05-25 00:11:22] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:11:22] [INFO ] [Real]Added 1640 Read/Feed constraints in 125 ms returned sat
[2026-05-25 00:11:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:23] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:23] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2026-05-25 00:11:23] [INFO ] [Nat]Added 1640 Read/Feed constraints in 132 ms returned sat
[2026-05-25 00:11:23] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 74 ms.
[2026-05-25 00:11:23] [INFO ] Added : 10 causal constraints over 2 iterations in 360 ms. Result :sat
Minimization took 2758 ms.
[2026-05-25 00:11:26] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:26] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:27] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:11:27] [INFO ] [Real]Added 1640 Read/Feed constraints in 123 ms returned sat
[2026-05-25 00:11:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:11:27] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:11:27] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2026-05-25 00:11:27] [INFO ] [Nat]Added 1640 Read/Feed constraints in 145 ms returned sat
[2026-05-25 00:11:27] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 74 ms.
[2026-05-25 00:11:28] [INFO ] Added : 6 causal constraints over 2 iterations in 349 ms. Result :sat
Minimization took 3335 ms.
[2026-05-25 00:11:31] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:31] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:31] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2026-05-25 00:11:32] [INFO ] [Real]Added 1640 Read/Feed constraints in 137 ms returned sat
[2026-05-25 00:11:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:32] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:32] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2026-05-25 00:11:32] [INFO ] [Nat]Added 1640 Read/Feed constraints in 177 ms returned sat
[2026-05-25 00:11:32] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 77 ms.
[2026-05-25 00:11:33] [INFO ] Added : 11 causal constraints over 3 iterations in 418 ms. Result :sat
Minimization took 3865 ms.
[2026-05-25 00:11:37] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:37] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:11:37] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2026-05-25 00:11:37] [INFO ] [Real]Added 1640 Read/Feed constraints in 124 ms returned sat
[2026-05-25 00:11:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:37] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:11:37] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2026-05-25 00:11:38] [INFO ] [Nat]Added 1640 Read/Feed constraints in 164 ms returned sat
[2026-05-25 00:11:38] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 72 ms.
[2026-05-25 00:11:38] [INFO ] Added : 9 causal constraints over 2 iterations in 357 ms. Result :sat
Minimization took 2654 ms.
[2026-05-25 00:11:41] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:41] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:41] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2026-05-25 00:11:41] [INFO ] [Real]Added 1640 Read/Feed constraints in 135 ms returned sat
[2026-05-25 00:11:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:41] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:11:42] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2026-05-25 00:11:42] [INFO ] [Nat]Added 1640 Read/Feed constraints in 133 ms returned sat
[2026-05-25 00:11:42] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 71 ms.
[2026-05-25 00:11:42] [INFO ] Added : 5 causal constraints over 1 iterations in 293 ms. Result :sat
Minimization took 3528 ms.
[2026-05-25 00:11:46] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:11:46] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:46] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2026-05-25 00:11:46] [INFO ] [Real]Added 1640 Read/Feed constraints in 123 ms returned sat
[2026-05-25 00:11:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:11:46] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:46] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2026-05-25 00:11:47] [INFO ] [Nat]Added 1640 Read/Feed constraints in 182 ms returned sat
[2026-05-25 00:11:47] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 73 ms.
[2026-05-25 00:11:47] [INFO ] Added : 8 causal constraints over 2 iterations in 345 ms. Result :sat
Minimization took 3010 ms.
[2026-05-25 00:11:50] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:11:50] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:11:50] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2026-05-25 00:11:51] [INFO ] [Real]Added 1640 Read/Feed constraints in 122 ms returned sat
[2026-05-25 00:11:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:11:51] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:11:51] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2026-05-25 00:11:51] [INFO ] [Nat]Added 1640 Read/Feed constraints in 204 ms returned sat
[2026-05-25 00:11:51] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 75 ms.
[2026-05-25 00:11:52] [INFO ] Added : 9 causal constraints over 2 iterations in 389 ms. Result :sat
Minimization took 3991 ms.
[2026-05-25 00:11:56] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:56] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:11:56] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2026-05-25 00:11:56] [INFO ] [Real]Added 1640 Read/Feed constraints in 114 ms returned sat
[2026-05-25 00:11:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:11:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:11:56] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:11:57] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2026-05-25 00:11:57] [INFO ] [Nat]Added 1640 Read/Feed constraints in 161 ms returned sat
[2026-05-25 00:11:57] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 77 ms.
[2026-05-25 00:11:57] [INFO ] Added : 7 causal constraints over 2 iterations in 362 ms. Result :sat
Minimization took 3675 ms.
[2026-05-25 00:12:01] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:12:01] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:12:01] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2026-05-25 00:12:01] [INFO ] [Real]Added 1640 Read/Feed constraints in 113 ms returned sat
[2026-05-25 00:12:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:12:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:12:01] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:12:02] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:12:02] [INFO ] [Nat]Added 1640 Read/Feed constraints in 196 ms returned sat
[2026-05-25 00:12:02] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 75 ms.
[2026-05-25 00:12:02] [INFO ] Added : 6 causal constraints over 2 iterations in 338 ms. Result :sat
Minimization took 3719 ms.
[2026-05-25 00:12:06] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:12:06] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:12:06] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2026-05-25 00:12:07] [INFO ] [Real]Added 1640 Read/Feed constraints in 116 ms returned sat
[2026-05-25 00:12:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:12:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:12:07] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:12:07] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2026-05-25 00:12:07] [INFO ] [Nat]Added 1640 Read/Feed constraints in 210 ms returned sat
[2026-05-25 00:12:07] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 71 ms.
[2026-05-25 00:12:08] [INFO ] Added : 10 causal constraints over 2 iterations in 331 ms. Result :sat
Minimization took 2755 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[19, 19, 19, 19, 19, 19, 19, 19, 19, 19]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[19, 19, 19, 19, 19, 19, 19, 19, 19, 19]
Support contains 10 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 581/581 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 22 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2026-05-25 00:12:10] [INFO ] Invariant cache hit.
[2026-05-25 00:12:11] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-25 00:12:11] [INFO ] Invariant cache hit.
[2026-05-25 00:12:11] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:12:22] [INFO ] Implicit Places using invariants and state equation in 11387 ms returned []
Implicit Place search using SMT with State Equation took 11754 ms to find 0 implicit places.
[2026-05-25 00:12:22] [INFO ] Redundant transitions in 36 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11817 ms. Remains : 581/581 places, 1773/1773 transitions.
[2026-05-25 00:12:22] [INFO ] Flatten gal took : 55 ms
[2026-05-25 00:12:22] [INFO ] Flatten gal took : 70 ms
[2026-05-25 00:12:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6263753611074692715.gal : 10 ms
[2026-05-25 00:12:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8158451352630539014.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/ReachabilityCardinality6263753611074692715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8158451352630539014.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 (359 resets) in 735 ms. (54 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 6 ms. (571 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
Loading property file /tmp/ReachabilityCardinality8158451352630539014.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :24 after 25
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :25 after 27
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :27 after 28
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :28 after 43
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :43 after 301
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :301 after 310
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :310 after 370
Interrupted probabilistic random walk after 352539 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 20
Probabilistic random walk after 352539 steps, saw 46198 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2026-05-25 00:12:26] [INFO ] Invariant cache hit.
[2026-05-25 00:12:26] [INFO ] State equation strengthened by 1640 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 38/577 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/579 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :370 after 3969
SMT process timed out in 5263ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 22 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 581/581 places, 1773/1773 transitions.
RANDOM walk for 40000 steps (357 resets) in 769 ms. (51 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 367683 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 20
Probabilistic random walk after 367683 steps, saw 47961 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2026-05-25 00:12:34] [INFO ] Invariant cache hit.
[2026-05-25 00:12:34] [INFO ] State equation strengthened by 1640 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 38/577 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/579 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :3969 after 5719
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
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/44 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 10 solved, 10 unsolved
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :5719 after 5860
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1773/2352 variables, 579/623 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2352 variables, 1640/2263 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2352 variables, 0/2263 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/2354 variables, 2/2265 constraints. Problems are: Problem set: 10 solved, 10 unsolved
SDD proceeding with computation,20 properties remain. new max is 8192
SDD size :5860 after 5956
At refinement iteration 13 (INCLUDED_ONLY) 0/2354 variables, 0/2265 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/2354 variables, 0/2265 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2354/2354 variables, and 2265 constraints, problems are : Problem set: 10 solved, 10 unsolved in 10976 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 581/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 2/3 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 38/577 variables, 19/22 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 1/23 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 0/23 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/579 variables, 2/25 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 19/44 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1773/2352 variables, 579/623 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2352 variables, 1640/2263 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2352 variables, 10/2273 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2352 variables, 0/2273 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 2/2354 variables, 2/2275 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2354 variables, 0/2275 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/2354 variables, 0/2275 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2354/2354 variables, and 2275 constraints, problems are : Problem set: 10 solved, 10 unsolved in 22135 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 581/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33139ms problems are : Problem set: 10 solved, 10 unsolved
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 21 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 581/581 places, 1773/1773 transitions.
RANDOM walk for 40000 steps (355 resets) in 451 ms. (88 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 36 ms. (1081 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 43 ms. (909 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (14 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 410008 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 10
Probabilistic random walk after 410008 steps, saw 52726 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2026-05-25 00:13:11] [INFO ] Invariant cache hit.
[2026-05-25 00:13:11] [INFO ] State equation strengthened by 1640 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/577 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/579 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,20 properties remain. new max is 16384
SDD size :5956 after 41239
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1773/2352 variables, 579/601 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2352 variables, 1640/2241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2352 variables, 0/2241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/2354 variables, 2/2243 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Detected timeout of ITS tools.
[2026-05-25 00:13:13] [INFO ] Flatten gal took : 31 ms
[2026-05-25 00:13:13] [INFO ] Applying decomposition
[2026-05-25 00:13:13] [INFO ] Flatten gal took : 34 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/graph6467016208919976017.txt' '-o' '/tmp/graph6467016208919976017.bin' '-w' '/tmp/graph6467016208919976017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6467016208919976017.bin' '-l' '-1' '-v' '-w' '/tmp/graph6467016208919976017.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:13:13] [INFO ] Decomposing Gal with order
[2026-05-25 00:13:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:13:13] [INFO ] Removed a total of 1345 redundant transitions.
[2026-05-25 00:13:13] [INFO ] Flatten gal took : 178 ms
[2026-05-25 00:13:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1368 labels/synchronizations in 35 ms.
[2026-05-25 00:13:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11799691980577856537.gal : 11 ms
[2026-05-25 00:13:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10911916671695022344.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/ReachabilityCardinality11799691980577856537.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10911916671695022344.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/ReachabilityCardinality10911916671695022344.prop.
At refinement iteration 11 (INCLUDED_ONLY) 0/2354 variables, 0/2243 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 46
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :46 after 46
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :46 after 46
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :46 after 46
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :46 after 46
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :46 after 46
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :46 after 46
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :46 after 46
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :46 after 919
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :919 after 1704
At refinement iteration 12 (OVERLAPS) 0/2354 variables, 0/2243 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2354/2354 variables, and 2243 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3720 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 581/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :1704 after 110357
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 38/577 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/579 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :110357 after 3.0274e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1773/2352 variables, 579/618 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2352 variables, 1640/2258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2352 variables, 10/2268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2352 variables, 0/2268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/2354 variables, 2/2270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :3.0274e+06 after 7.32754e+07
At refinement iteration 14 (INCLUDED_ONLY) 0/2354 variables, 0/2270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/2354 variables, 0/2270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2354/2354 variables, and 2270 constraints, problems are : Problem set: 0 solved, 10 unsolved in 29933 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 581/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33665ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 26 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 581/581 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 21 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2026-05-25 00:13:44] [INFO ] Invariant cache hit.
[2026-05-25 00:13:45] [INFO ] Implicit Places using invariants in 407 ms returned []
[2026-05-25 00:13:45] [INFO ] Invariant cache hit.
[2026-05-25 00:13:45] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:13:56] [INFO ] Implicit Places using invariants and state equation in 11231 ms returned []
Implicit Place search using SMT with State Equation took 11645 ms to find 0 implicit places.
[2026-05-25 00:13:56] [INFO ] Redundant transitions in 34 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11705 ms. Remains : 581/581 places, 1773/1773 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1566 edges and 581 vertex of which 487 / 581 are part of one of the 2 SCC in 3 ms
Free SCC test removed 485 places
Drop transitions (Empty/Sink Transition effects.) removed 1245 transitions
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 1639 transitions.
Graph (complete) has 255 edges and 96 vertex of which 37 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.0 ms
Discarding 59 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Reduce isomorphic transitions removed 55 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 56 rules applied. Total rules applied 58 place count 37 transition count 60
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 36 transition count 59
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 78 place count 18 transition count 41
Iterating global reduction 2 with 18 rules applied. Total rules applied 96 place count 18 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 17 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 17 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 17 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 17 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 16 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 16 transition count 32
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 109 place count 15 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 110 place count 14 transition count 30
Applied a total of 110 rules in 14 ms. Remains 14 /581 variables (removed 567) and now considering 30/1773 (removed 1743) transitions.
Running SMT prover for 10 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12800955271056424548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16536394268830931004.kers'
[2026-05-25 00:13:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12800955271056424548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16536394268830931004.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 14 cols 52 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 00:13:56] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16536394268830931004.kers
Total runtime 1 ms.
[2026-05-25 00:13:56] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
TRAPS : Iteration 0
[2026-05-25 00:13:56] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2026-05-25 00:13:56] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2026-05-25 00:13:56] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2026-05-25 00:13:56] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2026-05-25 00:13:56] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2026-05-25 00:13:56] [INFO ] Flatten gal took : 1 ms
[2026-05-25 00:13:56] [INFO ] Flatten gal took : 1 ms
[2026-05-25 00:13:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14720302766393748447.gal : 1 ms
[2026-05-25 00:13:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3694913614454358677.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/ReachabilityCardinality14720302766393748447.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3694913614454358677.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/ReachabilityCardinality3694913614454358677.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 8
Invariant property MIN8 does not hold.
Invariant property MIN7 does not hold.
Invariant property MIN6 does not hold.
Invariant property MIN3 does not hold.
Invariant property MIN2 does not hold.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :8 after 35
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :35 after 112
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :112 after 672
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :672 after 4719
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :4719 after 65892
Invariant property MIN5 does not hold.
Invariant property MIN1 does not hold.
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :65892 after 3.78214e+06
Invariant property MIN9 does not hold.
Invariant property MIN4 does not hold.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,1.45432e+08,0.055011,4868,2,307,22,5771,6,0,79,5309,0
Total reachable state count : 145432194
Verifying 10 reachability properties.
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,3.35048e+06,0.05531,4916,2,144,22,5771,7,0,82,5309,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,415701,0.055652,5128,2,112,22,5771,8,0,84,5309,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,35,0.055784,5128,2,16,22,5771,9,0,86,5309,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,2109,0.055909,5128,2,50,22,5771,10,0,88,5309,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,1.22578e+06,0.056057,5128,2,128,22,5771,11,0,90,5309,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,128877,0.056202,5128,2,96,22,5771,12,0,92,5309,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,324,0.056341,5128,2,33,22,5771,13,0,94,5309,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,10830,0.056471,5128,2,67,22,5771,14,0,96,5309,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,2,0.056597,5128,2,15,22,5771,15,0,98,5309,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,8.5805e+06,0.056773,5128,2,160,22,5771,16,0,100,5309,0
Over-approximation ignoring read arcs solved 0 properties in 303 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[18, 18, 18, 18, 18, 18, 18, 18, 18, 18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8183605979722961127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1650505103547851548.kers'
[2026-05-25 00:13:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8183605979722961127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1650505103547851548.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:13:56] [INFO ] Computed 22 invariants in 12 ms
Computed 22 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-1650505103547851548.kers
Total runtime 15 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[18, 18, 18, 18, 18, 18, 18, 18, 18, 18]
RANDOM walk for 1000000 steps (9051 resets) in 4489 ms. (222 steps per ms)
BEST_FIRST walk for 10000010 steps (4164 resets) in 7261 ms. (1377 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[18, 18, 18, 18, 18, 18, 18, 18, 18, 18]
[2026-05-25 00:14:08] [INFO ] Invariant cache hit.
[2026-05-25 00:14:08] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:08] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:09] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2026-05-25 00:14:09] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:14:09] [INFO ] [Real]Added 1640 Read/Feed constraints in 124 ms returned sat
[2026-05-25 00:14:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:14:09] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:09] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2026-05-25 00:14:09] [INFO ] [Nat]Added 1640 Read/Feed constraints in 131 ms returned sat
[2026-05-25 00:14:09] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 71 ms.
[2026-05-25 00:14:10] [INFO ] Added : 10 causal constraints over 2 iterations in 359 ms. Result :sat
Minimization took 2728 ms.
[2026-05-25 00:14:12] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:12] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:13] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2026-05-25 00:14:13] [INFO ] [Real]Added 1640 Read/Feed constraints in 124 ms returned sat
[2026-05-25 00:14:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:13] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:14:13] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2026-05-25 00:14:13] [INFO ] [Nat]Added 1640 Read/Feed constraints in 146 ms returned sat
[2026-05-25 00:14:14] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 74 ms.
[2026-05-25 00:14:14] [INFO ] Added : 6 causal constraints over 2 iterations in 358 ms. Result :sat
Minimization took 3295 ms.
[2026-05-25 00:14:17] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:17] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:14:18] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2026-05-25 00:14:18] [INFO ] [Real]Added 1640 Read/Feed constraints in 134 ms returned sat
[2026-05-25 00:14:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:18] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:14:18] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2026-05-25 00:14:18] [INFO ] [Nat]Added 1640 Read/Feed constraints in 179 ms returned sat
[2026-05-25 00:14:18] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 77 ms.
[2026-05-25 00:14:19] [INFO ] Added : 11 causal constraints over 3 iterations in 426 ms. Result :sat
Minimization took 3860 ms.
[2026-05-25 00:14:23] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:23] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:14:23] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2026-05-25 00:14:23] [INFO ] [Real]Added 1640 Read/Feed constraints in 125 ms returned sat
[2026-05-25 00:14:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:23] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:14:24] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2026-05-25 00:14:24] [INFO ] [Nat]Added 1640 Read/Feed constraints in 167 ms returned sat
[2026-05-25 00:14:24] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 76 ms.
[2026-05-25 00:14:24] [INFO ] Added : 9 causal constraints over 2 iterations in 359 ms. Result :sat
Minimization took 2672 ms.
[2026-05-25 00:14:27] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:27] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:27] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:14:27] [INFO ] [Real]Added 1640 Read/Feed constraints in 140 ms returned sat
[2026-05-25 00:14:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:14:27] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:28] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2026-05-25 00:14:28] [INFO ] [Nat]Added 1640 Read/Feed constraints in 139 ms returned sat
[2026-05-25 00:14:28] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 76 ms.
[2026-05-25 00:14:28] [INFO ] Added : 5 causal constraints over 1 iterations in 297 ms. Result :sat
Minimization took 3521 ms.
[2026-05-25 00:14:32] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:32] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:32] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2026-05-25 00:14:32] [INFO ] [Real]Added 1640 Read/Feed constraints in 122 ms returned sat
[2026-05-25 00:14:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:32] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:33] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2026-05-25 00:14:33] [INFO ] [Nat]Added 1640 Read/Feed constraints in 183 ms returned sat
[2026-05-25 00:14:33] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 76 ms.
[2026-05-25 00:14:33] [INFO ] Added : 8 causal constraints over 2 iterations in 365 ms. Result :sat
Minimization took 3067 ms.
[2026-05-25 00:14:36] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:14:36] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:37] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2026-05-25 00:14:37] [INFO ] [Real]Added 1640 Read/Feed constraints in 121 ms returned sat
[2026-05-25 00:14:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:37] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:14:37] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2026-05-25 00:14:38] [INFO ] [Nat]Added 1640 Read/Feed constraints in 202 ms returned sat
[2026-05-25 00:14:38] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 71 ms.
[2026-05-25 00:14:38] [INFO ] Added : 9 causal constraints over 2 iterations in 390 ms. Result :sat
Minimization took 3983 ms.
[2026-05-25 00:14:42] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:42] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:42] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2026-05-25 00:14:42] [INFO ] [Real]Added 1640 Read/Feed constraints in 112 ms returned sat
[2026-05-25 00:14:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:43] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:43] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2026-05-25 00:14:43] [INFO ] [Nat]Added 1640 Read/Feed constraints in 161 ms returned sat
[2026-05-25 00:14:43] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 73 ms.
[2026-05-25 00:14:43] [INFO ] Added : 7 causal constraints over 2 iterations in 369 ms. Result :sat
Minimization took 3628 ms.
[2026-05-25 00:14:47] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:47] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:14:47] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2026-05-25 00:14:48] [INFO ] [Real]Added 1640 Read/Feed constraints in 111 ms returned sat
[2026-05-25 00:14:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:48] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:14:48] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2026-05-25 00:14:48] [INFO ] [Nat]Added 1640 Read/Feed constraints in 197 ms returned sat
[2026-05-25 00:14:48] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 72 ms.
[2026-05-25 00:14:49] [INFO ] Added : 6 causal constraints over 2 iterations in 337 ms. Result :sat
Minimization took 3732 ms.
[2026-05-25 00:14:52] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:14:52] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:53] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2026-05-25 00:14:53] [INFO ] [Real]Added 1640 Read/Feed constraints in 113 ms returned sat
[2026-05-25 00:14:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:14:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 00:14:53] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:14:53] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2026-05-25 00:14:53] [INFO ] [Nat]Added 1640 Read/Feed constraints in 210 ms returned sat
[2026-05-25 00:14:54] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 74 ms.
[2026-05-25 00:14:54] [INFO ] Added : 10 causal constraints over 2 iterations in 336 ms. Result :sat
Minimization took 2723 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[18, 18, 18, 18, 18, 18, 18, 18, 18, 18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[18, 18, 18, 18, 18, 18, 18, 18, 18, 18]
Support contains 10 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 25 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 581/581 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 24 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2026-05-25 00:14:57] [INFO ] Invariant cache hit.
[2026-05-25 00:14:57] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-25 00:14:57] [INFO ] Invariant cache hit.
[2026-05-25 00:14:57] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:15:08] [INFO ] Implicit Places using invariants and state equation in 11065 ms returned []
Implicit Place search using SMT with State Equation took 11430 ms to find 0 implicit places.
[2026-05-25 00:15:08] [INFO ] Redundant transitions in 36 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11502 ms. Remains : 581/581 places, 1773/1773 transitions.
[2026-05-25 00:15:08] [INFO ] Flatten gal took : 44 ms
[2026-05-25 00:15:08] [INFO ] Flatten gal took : 28 ms
[2026-05-25 00:15:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16349743537046510380.gal : 8 ms
[2026-05-25 00:15:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1993576227084135359.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/ReachabilityCardinality16349743537046510380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1993576227084135359.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
RANDOM walk for 40000 steps (357 resets) in 588 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
Loading property file /tmp/ReachabilityCardinality1993576227084135359.prop.
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :24 after 25
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :25 after 27
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :27 after 28
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :28 after 43
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :43 after 301
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :301 after 310
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :310 after 370
Interrupted probabilistic random walk after 348302 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 20
Probabilistic random walk after 348302 steps, saw 45640 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2026-05-25 00:15:12] [INFO ] Invariant cache hit.
[2026-05-25 00:15:12] [INFO ] State equation strengthened by 1640 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 38/577 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/579 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 1773/2352 variables, 579/605 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :370 after 3969
At refinement iteration 10 (INCLUDED_ONLY) 0/2352 variables, 1640/2245 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2352/2354 variables, and 2245 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 579/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 38/577 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/579 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 1773/2352 variables, 579/607 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2352 variables, 1640/2247 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2352/2354 variables, and 2267 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 579/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10037ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 39 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 581/581 places, 1773/1773 transitions.
RANDOM walk for 40000 steps (364 resets) in 580 ms. (68 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :3969 after 5719
Interrupted probabilistic random walk after 370361 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 20
Probabilistic random walk after 370361 steps, saw 48291 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2026-05-25 00:15:25] [INFO ] Invariant cache hit.
[2026-05-25 00:15:25] [INFO ] State equation strengthened by 1640 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 38/577 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/579 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :5719 after 5860
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 1773/2352 variables, 579/605 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 8192
SDD size :5860 after 5956
At refinement iteration 10 (INCLUDED_ONLY) 0/2352 variables, 1640/2245 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2352 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 2/2354 variables, 2/2247 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2354 variables, 0/2247 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/2354 variables, 0/2247 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2354/2354 variables, and 2247 constraints, problems are : Problem set: 0 solved, 20 unsolved in 19562 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 581/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 529/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 38/577 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/579 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 1773/2352 variables, 579/607 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2352 variables, 1640/2247 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 16384
SDD size :5956 after 41239
Detected timeout of ITS tools.
[2026-05-25 00:15:58] [INFO ] Flatten gal took : 25 ms
[2026-05-25 00:15:58] [INFO ] Applying decomposition
[2026-05-25 00:15:58] [INFO ] Flatten gal took : 25 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/graph2923084610455882523.txt' '-o' '/tmp/graph2923084610455882523.bin' '-w' '/tmp/graph2923084610455882523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2923084610455882523.bin' '-l' '-1' '-v' '-w' '/tmp/graph2923084610455882523.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:15:58] [INFO ] Decomposing Gal with order
[2026-05-25 00:15:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:15:59] [INFO ] Removed a total of 1312 redundant transitions.
[2026-05-25 00:15:59] [INFO ] Flatten gal took : 112 ms
[2026-05-25 00:15:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1194 labels/synchronizations in 64 ms.
[2026-05-25 00:15:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13463004510655459204.gal : 14 ms
[2026-05-25 00:15:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17766077237189619138.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/ReachabilityCardinality13463004510655459204.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17766077237189619138.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/ReachabilityCardinality17766077237189619138.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 186
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :186 after 186
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :186 after 186
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :186 after 186
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :186 after 186
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :186 after 186
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :186 after 398
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :398 after 576
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :576 after 6557
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :6557 after 111698
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :111698 after 5.8515e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/2352 variables, 20/2267 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2352/2354 variables, and 2267 constraints, problems are : Problem set: 0 solved, 20 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 579/581 constraints, ReadFeed: 1640/1640 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64599ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 32 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 581/581 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Applied a total of 0 rules in 24 ms. Remains 581 /581 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2026-05-25 00:16:30] [INFO ] Invariant cache hit.
[2026-05-25 00:16:30] [INFO ] Implicit Places using invariants in 426 ms returned []
[2026-05-25 00:16:30] [INFO ] Invariant cache hit.
[2026-05-25 00:16:30] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:16:42] [INFO ] Implicit Places using invariants and state equation in 11505 ms returned []
Implicit Place search using SMT with State Equation took 11936 ms to find 0 implicit places.
[2026-05-25 00:16:42] [INFO ] Redundant transitions in 34 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12009 ms. Remains : 581/581 places, 1773/1773 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1566 edges and 581 vertex of which 487 / 581 are part of one of the 2 SCC in 0 ms
Free SCC test removed 485 places
Drop transitions (Empty/Sink Transition effects.) removed 1245 transitions
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 1639 transitions.
Graph (complete) has 255 edges and 96 vertex of which 37 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.0 ms
Discarding 59 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Reduce isomorphic transitions removed 55 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 56 rules applied. Total rules applied 58 place count 37 transition count 60
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 36 transition count 59
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 78 place count 18 transition count 41
Iterating global reduction 2 with 18 rules applied. Total rules applied 96 place count 18 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 17 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 17 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 17 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 17 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 16 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 16 transition count 32
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 109 place count 15 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 110 place count 14 transition count 30
Applied a total of 110 rules in 8 ms. Remains 14 /581 variables (removed 567) and now considering 30/1773 (removed 1743) transitions.
Running SMT prover for 20 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17325525918615979499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9304504501662837320.kers'
[2026-05-25 00:16:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17325525918615979499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9304504501662837320.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 14 cols 52 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 00:16:42] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9304504501662837320.kers
Total runtime 1 ms.
[2026-05-25 00:16:42] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:19
TRAPS : Iteration 0
[2026-05-25 00:16:42] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:20
[2026-05-25 00:16:42] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2026-05-25 00:16:42] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
TRAPS : Iteration 0
[2026-05-25 00:16:42] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
[2026-05-25 00:16:42] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
[2026-05-25 00:16:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 00:16:42] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:16:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4142947122702909162.gal : 0 ms
[2026-05-25 00:16:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality579682064238940495.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/ReachabilityCardinality4142947122702909162.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality579682064238940495.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/ReachabilityCardinality579682064238940495.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 8
Invariant property MIN8 does not hold.
Invariant property MIN7 does not hold.
Invariant property MIN6 does not hold.
Invariant property MIN3 does not hold.
Invariant property MIN2 does not hold.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :8 after 35
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :35 after 112
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :112 after 672
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :672 after 4719
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :4719 after 65892
Reachability property MAX8 is true.
Reachability property MAX7 is true.
Reachability property MAX6 is true.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Reachability property MAX3 is true.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :65892 after 3.78214e+06
Invariant property MIN9 does not hold.
Reachability property MAX9 is true.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,1.45432e+08,0.060901,4900,2,307,32,5841,6,0,79,5309,0
Total reachable state count : 145432194
Verifying 20 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.061163,4944,2,15,32,5841,7,0,82,5309,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,3.35048e+06,0.061495,5160,2,144,32,5841,8,0,84,5309,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,0.061699,5160,2,15,32,5841,9,0,86,5309,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,415701,0.061867,5160,2,112,32,5841,10,0,88,5309,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,3,0.061985,5160,2,16,32,5841,11,0,90,5309,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,35,0.0621,5160,2,16,32,5841,12,0,92,5309,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,5,0.062209,5160,2,18,32,5841,13,0,94,5309,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,2109,0.062333,5160,2,50,32,5841,14,0,96,5309,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,0.062436,5160,2,15,32,5841,15,0,98,5309,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,1.22578e+06,0.062582,5160,2,128,32,5841,16,0,100,5309,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,0.062688,5160,2,15,32,5841,17,0,102,5309,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,128877,0.062834,5160,2,96,32,5841,18,0,104,5309,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,4,0.062944,5160,2,17,32,5841,19,0,106,5309,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,324,0.063088,5160,2,33,32,5841,20,0,108,5309,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,6,0.06319,5160,2,19,32,5841,21,0,110,5309,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,10830,0.063314,5160,2,67,32,5841,22,0,112,5309,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,2,0.06342,5160,2,15,32,5841,23,0,114,5309,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,2,0.063527,5160,2,15,32,5841,24,0,116,5309,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,0.063624,5160,2,15,32,5841,25,0,118,5309,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,8.5805e+06,0.0638,5160,2,160,32,5841,26,0,120,5309,0
Over-approximation ignoring read arcs solved 0 properties in 300 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-730700566796992102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16592716407542248733.kers'
[2026-05-25 00:16:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-730700566796992102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16592716407542248733.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:16:42] [INFO ] Computed 22 invariants in 8 ms
Computed 22 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16592716407542248733.kers
Total runtime 11 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (92 resets) in 44 ms. (222 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:16:42] [INFO ] Invariant cache hit.
[2026-05-25 00:16:42] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:16:42] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:42] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2026-05-25 00:16:42] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:16:43] [INFO ] [Real]Added 1640 Read/Feed constraints in 121 ms returned sat
[2026-05-25 00:16:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:16:43] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:43] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2026-05-25 00:16:43] [INFO ] [Nat]Added 1640 Read/Feed constraints in 131 ms returned sat
[2026-05-25 00:16:43] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 76 ms.
[2026-05-25 00:16:43] [INFO ] Added : 10 causal constraints over 2 iterations in 365 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 576 transition count 1768
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 576 transition count 1767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 575 transition count 1767
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 575 transition count 1767
Applied a total of 15 rules in 105 ms. Remains 575 /581 variables (removed 6) and now considering 1767/1773 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 575/581 places, 1767/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12764099228458977973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10953339035183159599.kers'
[2026-05-25 00:16:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12764099228458977973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10953339035183159599.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1767 rows 575 cols 3816 entries
Finished phase 1 with 533 SingleSign rule and 20 generalized
[2026-05-25 00:16:44] [INFO ] Computed 22 invariants in 15 ms
Computed 22 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-10953339035183159599.kers
Total runtime 18 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9227 resets) in 4332 ms. (230 steps per ms)
BEST_FIRST walk for 1000001 steps (416 resets) in 716 ms. (1394 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:16:49] [INFO ] Invariant cache hit.
[2026-05-25 00:16:49] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:16:49] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 00:16:49] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2026-05-25 00:16:50] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:16:50] [INFO ] [Real]Added 1653 Read/Feed constraints in 145 ms returned sat
[2026-05-25 00:16:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:16:50] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:50] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2026-05-25 00:16:50] [INFO ] [Nat]Added 1653 Read/Feed constraints in 136 ms returned sat
[2026-05-25 00:16:50] [INFO ] Computed and/alt/rep : 1201/3594/1201 causal constraints (skipped 546 transitions) in 75 ms.
[2026-05-25 00:16:51] [INFO ] Added : 8 causal constraints over 2 iterations in 357 ms. Result :sat
Minimization took 3925 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 24 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:16:55] [INFO ] Invariant cache hit.
[2026-05-25 00:16:55] [INFO ] Implicit Places using invariants in 346 ms returned []
[2026-05-25 00:16:55] [INFO ] Invariant cache hit.
[2026-05-25 00:16:55] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:17:06] [INFO ] Implicit Places using invariants and state equation in 10898 ms returned []
Implicit Place search using SMT with State Equation took 11246 ms to find 0 implicit places.
[2026-05-25 00:17:06] [INFO ] Redundant transitions in 32 ms returned []
Running 1747 sub problems to find dead transitions.
[2026-05-25 00:17:06] [INFO ] Invariant cache hit.
[2026-05-25 00:17:06] [INFO ] State equation strengthened by 1653 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/2342 variables, and 62 constraints, problems are : Problem set: 0 solved, 1747 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/575 constraints, ReadFeed: 0/1653 constraints, PredecessorRefiner: 1747/1747 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1747 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/2342 variables, and 195 constraints, problems are : Problem set: 0 solved, 1747 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/575 constraints, ReadFeed: 0/1653 constraints, PredecessorRefiner: 0/1747 constraints, Known Traps: 173/173 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60472ms problems are : Problem set: 0 solved, 1747 unsolved
Search for dead transitions found 0 dead transitions in 60477ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71792 ms. Remains : 575/575 places, 1767/1767 transitions.
[2026-05-25 00:18:06] [INFO ] Flatten gal took : 53 ms
[2026-05-25 00:18:07] [INFO ] Flatten gal took : 40 ms
[2026-05-25 00:18:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13921720043907942372.gal : 8 ms
[2026-05-25 00:18:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6480663636513613867.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/ReachabilityCardinality13921720043907942372.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6480663636513613867.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
RANDOM walk for 40000 steps (371 resets) in 700 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6480663636513613867.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 248
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 304
Interrupted probabilistic random walk after 420546 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 2
Probabilistic random walk after 420546 steps, saw 53934 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2026-05-25 00:18:10] [INFO ] Invariant cache hit.
[2026-05-25 00:18:10] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :304 after 2735
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6785ms, 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 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 24 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 575/575 places, 1767/1767 transitions.
RANDOM walk for 40000 steps (367 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2735 after 3940
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3940 after 3964
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3964 after 4012
Interrupted probabilistic random walk after 432395 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 2
Probabilistic random walk after 432395 steps, saw 55262 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2026-05-25 00:18:20] [INFO ] Invariant cache hit.
[2026-05-25 00:18:20] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1767/2340 variables, 573/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2340 variables, 1653/2273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2340 variables, 2/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2342 variables, 2/2277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2342 variables, 0/2277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2342 variables, 0/2277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2342/2342 variables, and 2277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9735 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11469ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 30 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 31 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:18:31] [INFO ] Invariant cache hit.
[2026-05-25 00:18:32] [INFO ] Implicit Places using invariants in 356 ms returned []
[2026-05-25 00:18:32] [INFO ] Invariant cache hit.
[2026-05-25 00:18:32] [INFO ] State equation strengthened by 1653 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4012 after 23812
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :23812 after 24411
[2026-05-25 00:18:43] [INFO ] Implicit Places using invariants and state equation in 10996 ms returned []
Implicit Place search using SMT with State Equation took 11354 ms to find 0 implicit places.
[2026-05-25 00:18:43] [INFO ] Redundant transitions in 33 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11429 ms. Remains : 575/575 places, 1767/1767 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1592 edges and 575 vertex of which 492 / 575 are part of one of the 2 SCC in 1 ms
Free SCC test removed 490 places
Drop transitions (Empty/Sink Transition effects.) removed 1267 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 1662 transitions.
Graph (complete) has 225 edges and 85 vertex of which 25 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 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 58 rules applied. Total rules applied 60 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 80 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 98 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 100 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 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 103 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 104 place count 4 transition count 5
Applied a total of 104 rules in 10 ms. Remains 4 /575 variables (removed 571) and now considering 5/1767 (removed 1762) 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-11725825501310708432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-675607357467226011.kers'
[2026-05-25 00:18:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11725825501310708432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-675607357467226011.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 00:18:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-675607357467226011.kers
Total runtime 2 ms.
[2026-05-25 00:18:43] [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 00:18:43] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:18:43] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:18:43] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:18:43] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:18:43] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:18:43] [INFO ] Flatten gal took : 1 ms
[2026-05-25 00:18:43] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:18:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17075255538357034557.gal : 0 ms
[2026-05-25 00:18:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14443350634030135384.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/ReachabilityCardinality17075255538357034557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14443350634030135384.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/ReachabilityCardinality14443350634030135384.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
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,210,0.004156,4180,2,24,11,231,6,0,22,205,0
Total reachable state count : 210
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.00446,4240,2,5,11,231,7,0,25,205,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.004675,4240,2,5,11,231,8,0,27,205,0
Over-approximation ignoring read arcs solved 0 properties in 73 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:18:43] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:18:43] [INFO ] Applying decomposition
[2026-05-25 00:18:43] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7455650173823713272.txt' '-o' '/tmp/graph7455650173823713272.bin' '-w' '/tmp/graph7455650173823713272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7455650173823713272.bin' '-l' '-1' '-v' '-w' '/tmp/graph7455650173823713272.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:18:43] [INFO ] Decomposing Gal with order
[2026-05-25 00:18:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:18:43] [INFO ] Removed a total of 1358 redundant transitions.
[2026-05-25 00:18:43] [INFO ] Flatten gal took : 81 ms
[2026-05-25 00:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1582 labels/synchronizations in 62 ms.
[2026-05-25 00:18:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18193949017571429136.gal : 10 ms
[2026-05-25 00:18:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4471531372540430046.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/ReachabilityCardinality18193949017571429136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4471531372540430046.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/ReachabilityCardinality4471531372540430046.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 157
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :157 after 157
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :157 after 157
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :157 after 157
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :157 after 157
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :157 after 157
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :157 after 157
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :157 after 405
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :405 after 5730
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5730 after 136181
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :136181 after 1.9476e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.9476e+06 after 7.5893e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-00 in 171308 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5174736971462537774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2821330039884387234.kers'
[2026-05-25 00:19:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5174736971462537774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2821330039884387234.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:19:33] [INFO ] Computed 22 invariants in 10 ms
Computed 22 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-2821330039884387234.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (90 resets) in 48 ms. (204 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:19:33] [INFO ] Invariant cache hit.
[2026-05-25 00:19:33] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:19:33] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:19:34] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2026-05-25 00:19:34] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:19:34] [INFO ] [Real]Added 1640 Read/Feed constraints in 121 ms returned sat
[2026-05-25 00:19:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:19:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:19:34] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:19:34] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-25 00:19:34] [INFO ] [Nat]Added 1640 Read/Feed constraints in 152 ms returned sat
[2026-05-25 00:19:34] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 74 ms.
[2026-05-25 00:19:35] [INFO ] Added : 6 causal constraints over 2 iterations in 348 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 576 transition count 1768
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 576 transition count 1767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 575 transition count 1767
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 575 transition count 1767
Applied a total of 15 rules in 163 ms. Remains 575 /581 variables (removed 6) and now considering 1767/1773 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 575/581 places, 1767/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3107001461504055783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1780625454430968201.kers'
[2026-05-25 00:19:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3107001461504055783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1780625454430968201.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1767 rows 575 cols 3816 entries
Finished phase 1 with 533 SingleSign rule and 20 generalized
[2026-05-25 00:19:35] [INFO ] Computed 22 invariants in 12 ms
Computed 22 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-1780625454430968201.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9222 resets) in 4431 ms. (225 steps per ms)
BEST_FIRST walk for 1000001 steps (418 resets) in 711 ms. (1404 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:19:41] [INFO ] Invariant cache hit.
[2026-05-25 00:19:41] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:19:41] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:19:41] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2026-05-25 00:19:41] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:19:41] [INFO ] [Real]Added 1653 Read/Feed constraints in 130 ms returned sat
[2026-05-25 00:19:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:19:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:19:41] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:19:42] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:19:42] [INFO ] [Nat]Added 1653 Read/Feed constraints in 151 ms returned sat
[2026-05-25 00:19:42] [INFO ] Computed and/alt/rep : 1201/3594/1201 causal constraints (skipped 546 transitions) in 72 ms.
[2026-05-25 00:19:42] [INFO ] Added : 9 causal constraints over 3 iterations in 446 ms. Result :sat
Minimization took 2859 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:19:45] [INFO ] Invariant cache hit.
[2026-05-25 00:19:45] [INFO ] Implicit Places using invariants in 372 ms returned []
[2026-05-25 00:19:45] [INFO ] Invariant cache hit.
[2026-05-25 00:19:46] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:19:58] [INFO ] Implicit Places using invariants and state equation in 12927 ms returned []
Implicit Place search using SMT with State Equation took 13301 ms to find 0 implicit places.
[2026-05-25 00:19:58] [INFO ] Redundant transitions in 37 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13372 ms. Remains : 575/575 places, 1767/1767 transitions.
[2026-05-25 00:19:59] [INFO ] Flatten gal took : 30 ms
[2026-05-25 00:19:59] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:19:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11182155340685075653.gal : 5 ms
[2026-05-25 00:19:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12494921564351620213.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/ReachabilityCardinality11182155340685075653.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12494921564351620213.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
RANDOM walk for 40000 steps (365 resets) in 663 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12494921564351620213.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 248
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 304
Interrupted probabilistic random walk after 433146 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 2
Probabilistic random walk after 433146 steps, saw 55331 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2026-05-25 00:20:02] [INFO ] Invariant cache hit.
[2026-05-25 00:20:02] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :304 after 2735
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 7095ms, 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 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 24 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 575/575 places, 1767/1767 transitions.
RANDOM walk for 40000 steps (368 resets) in 414 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (13 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (16 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2735 after 3940
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3940 after 3964
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3964 after 4012
Interrupted probabilistic random walk after 430697 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 430697 steps, saw 55077 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2026-05-25 00:20:12] [INFO ] Invariant cache hit.
[2026-05-25 00:20:12] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1991 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1767/2340 variables, 573/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2340 variables, 1653/2284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2340 variables, 2/2286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2342 variables, 2/2288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4012 after 23812
At refinement iteration 15 (INCLUDED_ONLY) 0/2342 variables, 0/2288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2342 variables, 0/2288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2342/2342 variables, and 2288 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12155 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14156ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 41 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 34 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:20:26] [INFO ] Invariant cache hit.
[2026-05-25 00:20:27] [INFO ] Implicit Places using invariants in 392 ms returned []
[2026-05-25 00:20:27] [INFO ] Invariant cache hit.
[2026-05-25 00:20:27] [INFO ] State equation strengthened by 1653 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :23812 after 24407
[2026-05-25 00:20:39] [INFO ] Implicit Places using invariants and state equation in 12694 ms returned []
Implicit Place search using SMT with State Equation took 13088 ms to find 0 implicit places.
[2026-05-25 00:20:39] [INFO ] Redundant transitions in 30 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13164 ms. Remains : 575/575 places, 1767/1767 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1592 edges and 575 vertex of which 492 / 575 are part of one of the 2 SCC in 0 ms
Free SCC test removed 490 places
Drop transitions (Empty/Sink Transition effects.) removed 1267 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 1662 transitions.
Graph (complete) has 225 edges and 85 vertex of which 25 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 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 58 rules applied. Total rules applied 60 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 80 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 98 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 100 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 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 103 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 104 place count 4 transition count 5
Applied a total of 104 rules in 5 ms. Remains 4 /575 variables (removed 571) and now considering 5/1767 (removed 1762) 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-9070615963380326612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6122185506432512824.kers'
[2026-05-25 00:20:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9070615963380326612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6122185506432512824.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 00:20:39] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6122185506432512824.kers
Total runtime 0 ms.
[2026-05-25 00:20:39] [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 00:20:39] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:20:39] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:20:39] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:20:39] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:20:39] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:20:39] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:20:39] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:20:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2643234801837675618.gal : 0 ms
[2026-05-25 00:20:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5023512721970480447.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/ReachabilityCardinality2643234801837675618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5023512721970480447.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/ReachabilityCardinality5023512721970480447.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
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,210,0.003717,4180,2,24,11,231,6,0,22,205,0
Total reachable state count : 210
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.003926,4236,2,5,11,231,7,0,25,205,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.004056,4236,2,5,11,231,8,0,27,205,0
Over-approximation ignoring read arcs solved 0 properties in 81 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:20:40] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:20:40] [INFO ] Applying decomposition
[2026-05-25 00:20:40] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15100645278826150000.txt' '-o' '/tmp/graph15100645278826150000.bin' '-w' '/tmp/graph15100645278826150000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15100645278826150000.bin' '-l' '-1' '-v' '-w' '/tmp/graph15100645278826150000.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:20:40] [INFO ] Decomposing Gal with order
[2026-05-25 00:20:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:20:40] [INFO ] Removed a total of 1352 redundant transitions.
[2026-05-25 00:20:40] [INFO ] Flatten gal took : 71 ms
[2026-05-25 00:20:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1440 labels/synchronizations in 29 ms.
[2026-05-25 00:20:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11628030360433821514.gal : 11 ms
[2026-05-25 00:20:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11956797049028898950.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/ReachabilityCardinality11628030360433821514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11956797049028898950.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/ReachabilityCardinality11956797049028898950.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 38
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :38 after 38
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 38
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :38 after 38
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :38 after 38
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :38 after 1864
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1864 after 2795
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2795 after 245989
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :245989 after 1.06513e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.06513e+07 after 1.3e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-01 in 116682 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1469705440741957239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4827214405335648628.kers'
[2026-05-25 00:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1469705440741957239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4827214405335648628.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:21:30] [INFO ] Computed 22 invariants in 9 ms
Computed 22 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-4827214405335648628.kers
Total runtime 12 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (91 resets) in 48 ms. (204 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:21:30] [INFO ] Invariant cache hit.
[2026-05-25 00:21:30] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:21:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:21:30] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2026-05-25 00:21:30] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:21:31] [INFO ] [Real]Added 1640 Read/Feed constraints in 136 ms returned sat
[2026-05-25 00:21:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:21:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:21:31] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:21:31] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2026-05-25 00:21:31] [INFO ] [Nat]Added 1640 Read/Feed constraints in 179 ms returned sat
[2026-05-25 00:21:31] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 78 ms.
[2026-05-25 00:21:32] [INFO ] Added : 11 causal constraints over 3 iterations in 430 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 576 transition count 1768
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 576 transition count 1767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 575 transition count 1767
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 575 transition count 1767
Applied a total of 15 rules in 93 ms. Remains 575 /581 variables (removed 6) and now considering 1767/1773 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 575/581 places, 1767/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17266765345347745937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16852262663864919180.kers'
[2026-05-25 00:21:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17266765345347745937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16852262663864919180.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1767 rows 575 cols 3816 entries
Finished phase 1 with 533 SingleSign rule and 20 generalized
[2026-05-25 00:21:32] [INFO ] Computed 22 invariants in 8 ms
Computed 22 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16852262663864919180.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9212 resets) in 4388 ms. (227 steps per ms)
BEST_FIRST walk for 1000001 steps (423 resets) in 731 ms. (1366 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:21:37] [INFO ] Invariant cache hit.
[2026-05-25 00:21:37] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:21:37] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:21:38] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2026-05-25 00:21:38] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:21:38] [INFO ] [Real]Added 1653 Read/Feed constraints in 131 ms returned sat
[2026-05-25 00:21:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:21:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:21:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:21:38] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2026-05-25 00:21:38] [INFO ] [Nat]Added 1653 Read/Feed constraints in 134 ms returned sat
[2026-05-25 00:21:38] [INFO ] Computed and/alt/rep : 1203/3602/1203 causal constraints (skipped 544 transitions) in 75 ms.
[2026-05-25 00:21:39] [INFO ] Added : 6 causal constraints over 2 iterations in 340 ms. Result :sat
Minimization took 3487 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:21:42] [INFO ] Invariant cache hit.
[2026-05-25 00:21:43] [INFO ] Implicit Places using invariants in 368 ms returned []
[2026-05-25 00:21:43] [INFO ] Invariant cache hit.
[2026-05-25 00:21:43] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:21:54] [INFO ] Implicit Places using invariants and state equation in 11546 ms returned []
Implicit Place search using SMT with State Equation took 11918 ms to find 0 implicit places.
[2026-05-25 00:21:54] [INFO ] Redundant transitions in 38 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11989 ms. Remains : 575/575 places, 1767/1767 transitions.
[2026-05-25 00:21:54] [INFO ] Flatten gal took : 19 ms
[2026-05-25 00:21:54] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:21:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10371683448980685498.gal : 5 ms
[2026-05-25 00:21:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3700958082149898709.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/ReachabilityCardinality10371683448980685498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3700958082149898709.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
RANDOM walk for 40000 steps (363 resets) in 455 ms. (87 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3700958082149898709.prop.
BEST_FIRST walk for 40004 steps (16 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 248
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 304
Interrupted probabilistic random walk after 411940 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 411940 steps, saw 53010 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2026-05-25 00:21:58] [INFO ] Invariant cache hit.
[2026-05-25 00:21:58] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :304 after 2729
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6237ms, 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 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 25 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 575/575 places, 1767/1767 transitions.
RANDOM walk for 40000 steps (366 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2729 after 3940
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3940 after 3964
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3964 after 4012
Interrupted probabilistic random walk after 430076 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 430076 steps, saw 55009 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2026-05-25 00:22:07] [INFO ] Invariant cache hit.
[2026-05-25 00:22:07] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1767/2340 variables, 573/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2340 variables, 1653/2272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2340 variables, 2/2274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2342 variables, 2/2276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2342 variables, 0/2276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2342 variables, 0/2276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2342/2342 variables, and 2276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8574 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9791ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 28 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 24 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:22:17] [INFO ] Invariant cache hit.
[2026-05-25 00:22:17] [INFO ] Implicit Places using invariants in 384 ms returned []
[2026-05-25 00:22:17] [INFO ] Invariant cache hit.
[2026-05-25 00:22:18] [INFO ] State equation strengthened by 1653 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4012 after 23808
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :23808 after 24407
[2026-05-25 00:22:29] [INFO ] Implicit Places using invariants and state equation in 11791 ms returned []
Implicit Place search using SMT with State Equation took 12183 ms to find 0 implicit places.
[2026-05-25 00:22:29] [INFO ] Redundant transitions in 31 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12247 ms. Remains : 575/575 places, 1767/1767 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1592 edges and 575 vertex of which 492 / 575 are part of one of the 2 SCC in 0 ms
Free SCC test removed 490 places
Drop transitions (Empty/Sink Transition effects.) removed 1267 transitions
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 1663 transitions.
Graph (complete) has 224 edges and 85 vertex of which 25 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 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 57 rules applied. Total rules applied 59 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 79 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 97 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 99 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 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 102 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 103 place count 4 transition count 5
Applied a total of 103 rules in 6 ms. Remains 4 /575 variables (removed 571) and now considering 5/1767 (removed 1762) 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-12971473440375180784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-343321193025509678.kers'
[2026-05-25 00:22:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12971473440375180784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-343321193025509678.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 00:22:29] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-343321193025509678.kers
Total runtime 1 ms.
[2026-05-25 00:22:29] [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 00:22:29] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:22:29] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:22:29] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:22:29] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:22:29] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:22:29] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:22:29] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:22:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12888891212883011052.gal : 0 ms
[2026-05-25 00:22:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14692352311395238873.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/ReachabilityCardinality12888891212883011052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14692352311395238873.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/ReachabilityCardinality14692352311395238873.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
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,210,0.009841,4184,2,24,11,231,6,0,22,205,0
Total reachable state count : 210
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.010622,4232,2,5,11,231,7,0,25,205,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.010802,4232,2,5,11,231,8,0,27,205,0
Over-approximation ignoring read arcs solved 0 properties in 87 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:22:29] [INFO ] Flatten gal took : 19 ms
[2026-05-25 00:22:29] [INFO ] Applying decomposition
[2026-05-25 00:22:29] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12462419332101213067.txt' '-o' '/tmp/graph12462419332101213067.bin' '-w' '/tmp/graph12462419332101213067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12462419332101213067.bin' '-l' '-1' '-v' '-w' '/tmp/graph12462419332101213067.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:22:29] [INFO ] Decomposing Gal with order
[2026-05-25 00:22:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:22:29] [INFO ] Removed a total of 1358 redundant transitions.
[2026-05-25 00:22:29] [INFO ] Flatten gal took : 62 ms
[2026-05-25 00:22:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1604 labels/synchronizations in 30 ms.
[2026-05-25 00:22:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6417781747515650238.gal : 10 ms
[2026-05-25 00:22:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9531984803483376551.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/ReachabilityCardinality6417781747515650238.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9531984803483376551.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/ReachabilityCardinality9531984803483376551.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 101
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :101 after 101
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :101 after 101
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :101 after 101
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :101 after 101
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :101 after 101
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :101 after 101
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :101 after 101
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :101 after 101
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5141 after 5541
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5541 after 8330
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.32534e+07 after 1.8379e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.8379e+07 after 2.02271e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-02 in 109600 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8934756700357940542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1589728656302275756.kers'
[2026-05-25 00:23:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8934756700357940542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1589728656302275756.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:23:20] [INFO ] Computed 22 invariants in 13 ms
Computed 22 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1589728656302275756.kers
Total runtime 17 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (90 resets) in 48 ms. (204 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:23:20] [INFO ] Invariant cache hit.
[2026-05-25 00:23:20] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:23:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:23:20] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:23:20] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:23:20] [INFO ] [Real]Added 1640 Read/Feed constraints in 121 ms returned sat
[2026-05-25 00:23:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:23:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:23:20] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 00:23:21] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2026-05-25 00:23:21] [INFO ] [Nat]Added 1640 Read/Feed constraints in 159 ms returned sat
[2026-05-25 00:23:21] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 70 ms.
[2026-05-25 00:23:21] [INFO ] Added : 9 causal constraints over 2 iterations in 355 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 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 576 transition count 1768
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 576 transition count 1767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 575 transition count 1767
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 575 transition count 1767
Applied a total of 15 rules in 85 ms. Remains 575 /581 variables (removed 6) and now considering 1767/1773 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 575/581 places, 1767/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11522040498415827750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9391286280271374928.kers'
[2026-05-25 00:23:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11522040498415827750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9391286280271374928.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1767 rows 575 cols 3816 entries
Finished phase 1 with 533 SingleSign rule and 20 generalized
[2026-05-25 00:23:22] [INFO ] Computed 22 invariants in 17 ms
Computed 22 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-9391286280271374928.kers
Total runtime 21 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9227 resets) in 4409 ms. (226 steps per ms)
BEST_FIRST walk for 1000001 steps (419 resets) in 713 ms. (1400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:23:27] [INFO ] Invariant cache hit.
[2026-05-25 00:23:27] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:23:27] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:23:27] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2026-05-25 00:23:27] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:23:27] [INFO ] [Real]Added 1653 Read/Feed constraints in 125 ms returned sat
[2026-05-25 00:23:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:23:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:23:27] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:23:28] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2026-05-25 00:23:28] [INFO ] [Nat]Added 1653 Read/Feed constraints in 156 ms returned sat
[2026-05-25 00:23:28] [INFO ] Computed and/alt/rep : 1201/3594/1201 causal constraints (skipped 546 transitions) in 82 ms.
[2026-05-25 00:23:28] [INFO ] Added : 8 causal constraints over 2 iterations in 363 ms. Result :sat
Minimization took 3513 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:23:32] [INFO ] Invariant cache hit.
[2026-05-25 00:23:32] [INFO ] Implicit Places using invariants in 372 ms returned []
[2026-05-25 00:23:32] [INFO ] Invariant cache hit.
[2026-05-25 00:23:33] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:23:45] [INFO ] Implicit Places using invariants and state equation in 12583 ms returned []
Implicit Place search using SMT with State Equation took 12957 ms to find 0 implicit places.
[2026-05-25 00:23:45] [INFO ] Redundant transitions in 38 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13029 ms. Remains : 575/575 places, 1767/1767 transitions.
[2026-05-25 00:23:45] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:23:45] [INFO ] Flatten gal took : 29 ms
[2026-05-25 00:23:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13751474342918074634.gal : 6 ms
[2026-05-25 00:23:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17008172388934076465.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/ReachabilityCardinality13751474342918074634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17008172388934076465.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
RANDOM walk for 40000 steps (366 resets) in 377 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (14 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17008172388934076465.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 248
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 304
Interrupted probabilistic random walk after 416041 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 2
Probabilistic random walk after 416041 steps, saw 53482 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2026-05-25 00:23:48] [INFO ] Invariant cache hit.
[2026-05-25 00:23:48] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :304 after 2735
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1468 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6538ms, 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 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 575/575 places, 1767/1767 transitions.
RANDOM walk for 40000 steps (360 resets) in 296 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2735 after 3940
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3940 after 3964
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3964 after 4012
Interrupted probabilistic random walk after 426270 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 2
Probabilistic random walk after 426270 steps, saw 54609 distinct states, run finished after 3002 ms. (steps per millisecond=141 ) properties seen :0
[2026-05-25 00:23:58] [INFO ] Invariant cache hit.
[2026-05-25 00:23:58] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1384 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1767/2340 variables, 573/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 1653/2271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2340 variables, 2/2273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2340 variables, 0/2273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/2342 variables, 2/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2342 variables, 0/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2342 variables, 0/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2342/2342 variables, and 2275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8650 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10042ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 29 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:24:08] [INFO ] Invariant cache hit.
[2026-05-25 00:24:08] [INFO ] Implicit Places using invariants in 389 ms returned []
[2026-05-25 00:24:08] [INFO ] Invariant cache hit.
[2026-05-25 00:24:09] [INFO ] State equation strengthened by 1653 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4012 after 23814
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :23814 after 24407
[2026-05-25 00:24:21] [INFO ] Implicit Places using invariants and state equation in 12989 ms returned []
Implicit Place search using SMT with State Equation took 13383 ms to find 0 implicit places.
[2026-05-25 00:24:21] [INFO ] Redundant transitions in 33 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13449 ms. Remains : 575/575 places, 1767/1767 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1592 edges and 575 vertex of which 492 / 575 are part of one of the 2 SCC in 1 ms
Free SCC test removed 490 places
Drop transitions (Empty/Sink Transition effects.) removed 1267 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 1662 transitions.
Graph (complete) has 225 edges and 85 vertex of which 25 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 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 58 rules applied. Total rules applied 60 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 80 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 98 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 100 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 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 103 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 104 place count 4 transition count 5
Applied a total of 104 rules in 5 ms. Remains 4 /575 variables (removed 571) and now considering 5/1767 (removed 1762) 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-8430128157164524660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10913382712394627536.kers'
[2026-05-25 00:24:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8430128157164524660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10913382712394627536.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 00:24:21] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10913382712394627536.kers
Total runtime 2 ms.
[2026-05-25 00:24:21] [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 00:24:21] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:24:21] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:24:21] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:24:21] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:24:21] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:24:21] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:24:21] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:24:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12490580858752429798.gal : 0 ms
[2026-05-25 00:24:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality656941635220647186.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/ReachabilityCardinality12490580858752429798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality656941635220647186.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/ReachabilityCardinality656941635220647186.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
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,210,0.003281,4180,2,24,11,231,6,0,22,205,0
Total reachable state count : 210
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.003468,4236,2,5,11,231,7,0,25,205,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.003574,4236,2,5,11,231,8,0,27,205,0
Over-approximation ignoring read arcs solved 0 properties in 69 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:24:21] [INFO ] Flatten gal took : 19 ms
[2026-05-25 00:24:21] [INFO ] Applying decomposition
[2026-05-25 00:24:21] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10163201471025089541.txt' '-o' '/tmp/graph10163201471025089541.bin' '-w' '/tmp/graph10163201471025089541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10163201471025089541.bin' '-l' '-1' '-v' '-w' '/tmp/graph10163201471025089541.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:24:22] [INFO ] Decomposing Gal with order
[2026-05-25 00:24:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:24:22] [INFO ] Removed a total of 1354 redundant transitions.
[2026-05-25 00:24:22] [INFO ] Flatten gal took : 62 ms
[2026-05-25 00:24:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 1515 labels/synchronizations in 28 ms.
[2026-05-25 00:24:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8821387853934287021.gal : 10 ms
[2026-05-25 00:24:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15117033901112262639.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/ReachabilityCardinality8821387853934287021.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15117033901112262639.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/ReachabilityCardinality15117033901112262639.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 48
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :48 after 48
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :48 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 48
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :48 after 48
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :48 after 48
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :48 after 48
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :48 after 803
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :803 after 1176
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1176 after 31250
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :31250 after 462990
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :462990 after 3.02961e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-05 in 112238 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6559343607434295271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12173455268928730480.kers'
[2026-05-25 00:25:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6559343607434295271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12173455268928730480.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:25:12] [INFO ] Computed 22 invariants in 16 ms
Computed 22 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-12173455268928730480.kers
Total runtime 18 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (89 resets) in 47 ms. (208 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:25:12] [INFO ] Invariant cache hit.
[2026-05-25 00:25:12] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:25:12] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:25:12] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2026-05-25 00:25:12] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:25:12] [INFO ] [Real]Added 1640 Read/Feed constraints in 133 ms returned sat
[2026-05-25 00:25:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:25:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:25:12] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:25:13] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2026-05-25 00:25:13] [INFO ] [Nat]Added 1640 Read/Feed constraints in 135 ms returned sat
[2026-05-25 00:25:13] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 71 ms.
[2026-05-25 00:25:13] [INFO ] Added : 5 causal constraints over 1 iterations in 291 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 576 transition count 1768
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 576 transition count 1767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 575 transition count 1767
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 575 transition count 1767
Applied a total of 15 rules in 91 ms. Remains 575 /581 variables (removed 6) and now considering 1767/1773 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 575/581 places, 1767/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16225962012553088480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15638808074830999109.kers'
[2026-05-25 00:25:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16225962012553088480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15638808074830999109.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1767 rows 575 cols 3816 entries
Finished phase 1 with 533 SingleSign rule and 20 generalized
[2026-05-25 00:25:14] [INFO ] Computed 22 invariants in 14 ms
Computed 22 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-15638808074830999109.kers
Total runtime 17 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9224 resets) in 4384 ms. (228 steps per ms)
BEST_FIRST walk for 1000001 steps (419 resets) in 714 ms. (1398 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:25:19] [INFO ] Invariant cache hit.
[2026-05-25 00:25:19] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:25:19] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:25:19] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2026-05-25 00:25:19] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:25:19] [INFO ] [Real]Added 1653 Read/Feed constraints in 131 ms returned sat
[2026-05-25 00:25:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:25:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:25:20] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:25:20] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:25:20] [INFO ] [Nat]Added 1653 Read/Feed constraints in 136 ms returned sat
[2026-05-25 00:25:20] [INFO ] Computed and/alt/rep : 1203/3602/1203 causal constraints (skipped 544 transitions) in 76 ms.
[2026-05-25 00:25:20] [INFO ] Added : 5 causal constraints over 1 iterations in 280 ms. Result :sat
Minimization took 3148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:25:24] [INFO ] Invariant cache hit.
[2026-05-25 00:25:24] [INFO ] Implicit Places using invariants in 403 ms returned []
[2026-05-25 00:25:24] [INFO ] Invariant cache hit.
[2026-05-25 00:25:24] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:25:35] [INFO ] Implicit Places using invariants and state equation in 11516 ms returned []
Implicit Place search using SMT with State Equation took 11923 ms to find 0 implicit places.
[2026-05-25 00:25:36] [INFO ] Redundant transitions in 30 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11985 ms. Remains : 575/575 places, 1767/1767 transitions.
[2026-05-25 00:25:36] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:25:36] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:25:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14135033756509308373.gal : 6 ms
[2026-05-25 00:25:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16954585685320698374.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/ReachabilityCardinality14135033756509308373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16954585685320698374.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
RANDOM walk for 40000 steps (363 resets) in 370 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16954585685320698374.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 246
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :246 after 300
Interrupted probabilistic random walk after 433306 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 2
Probabilistic random walk after 433306 steps, saw 55346 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2026-05-25 00:25:39] [INFO ] Invariant cache hit.
[2026-05-25 00:25:39] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :300 after 2673
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6500ms, 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 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 575/575 places, 1767/1767 transitions.
RANDOM walk for 40000 steps (365 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2673 after 3936
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3936 after 3964
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3964 after 4012
Interrupted probabilistic random walk after 435556 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 2
Probabilistic random walk after 435556 steps, saw 55575 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2026-05-25 00:25:48] [INFO ] Invariant cache hit.
[2026-05-25 00:25:48] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1767/2340 variables, 573/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2340 variables, 1653/2273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2340 variables, 2/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2342 variables, 2/2277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2342 variables, 0/2277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2342 variables, 0/2277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2342/2342 variables, and 2277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9053 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10465ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:25:59] [INFO ] Invariant cache hit.
[2026-05-25 00:25:59] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-05-25 00:25:59] [INFO ] Invariant cache hit.
[2026-05-25 00:26:00] [INFO ] State equation strengthened by 1653 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4012 after 23790
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :23790 after 24371
[2026-05-25 00:26:11] [INFO ] Implicit Places using invariants and state equation in 11875 ms returned []
Implicit Place search using SMT with State Equation took 12309 ms to find 0 implicit places.
[2026-05-25 00:26:11] [INFO ] Redundant transitions in 31 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12376 ms. Remains : 575/575 places, 1767/1767 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1592 edges and 575 vertex of which 492 / 575 are part of one of the 2 SCC in 0 ms
Free SCC test removed 490 places
Drop transitions (Empty/Sink Transition effects.) removed 1267 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 1662 transitions.
Graph (complete) has 225 edges and 85 vertex of which 25 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 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 58 rules applied. Total rules applied 60 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 80 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 98 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 100 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 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 103 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 104 place count 4 transition count 5
Applied a total of 104 rules in 2 ms. Remains 4 /575 variables (removed 571) and now considering 5/1767 (removed 1762) 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-4178823511804769264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10178043686991518235.kers'
[2026-05-25 00:26:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4178823511804769264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10178043686991518235.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 00:26:11] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10178043686991518235.kers
Total runtime 0 ms.
[2026-05-25 00:26:11] [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 00:26:11] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:26:11] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:26:11] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:26:11] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:26:11] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:26:11] [INFO ] Flatten gal took : 1 ms
[2026-05-25 00:26:11] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:26:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2403269637333907120.gal : 0 ms
[2026-05-25 00:26:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12833778265299744090.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/ReachabilityCardinality2403269637333907120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12833778265299744090.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/ReachabilityCardinality12833778265299744090.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
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,210,0.003243,4180,2,24,11,231,6,0,22,205,0
Total reachable state count : 210
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.003429,4224,2,5,11,231,7,0,25,205,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.003536,4224,2,5,11,231,8,0,27,205,0
Over-approximation ignoring read arcs solved 0 properties in 76 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:26:11] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:26:11] [INFO ] Applying decomposition
[2026-05-25 00:26:11] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8723487550242385060.txt' '-o' '/tmp/graph8723487550242385060.bin' '-w' '/tmp/graph8723487550242385060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8723487550242385060.bin' '-l' '-1' '-v' '-w' '/tmp/graph8723487550242385060.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:26:11] [INFO ] Decomposing Gal with order
[2026-05-25 00:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:26:12] [INFO ] Removed a total of 1357 redundant transitions.
[2026-05-25 00:26:12] [INFO ] Flatten gal took : 59 ms
[2026-05-25 00:26:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1438 labels/synchronizations in 28 ms.
[2026-05-25 00:26:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8161424079863793715.gal : 10 ms
[2026-05-25 00:26:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4631111302615010214.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/ReachabilityCardinality8161424079863793715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4631111302615010214.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/ReachabilityCardinality4631111302615010214.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 214
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :214 after 214
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :214 after 214
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :214 after 214
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :214 after 214
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :214 after 214
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :214 after 297
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :297 after 542
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :542 after 8971
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8971 after 205133
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :205133 after 1.3351e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.3351e+06 after 1.12183e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-06 in 109938 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4354431733441477988.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8200522751975493344.kers'
[2026-05-25 00:27:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4354431733441477988.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8200522751975493344.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:27:02] [INFO ] Computed 22 invariants in 11 ms
Computed 22 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8200522751975493344.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (92 resets) in 43 ms. (227 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:27:02] [INFO ] Invariant cache hit.
[2026-05-25 00:27:02] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:27:02] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:27:02] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2026-05-25 00:27:02] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:27:02] [INFO ] [Real]Added 1640 Read/Feed constraints in 125 ms returned sat
[2026-05-25 00:27:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:27:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-25 00:27:02] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:27:03] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2026-05-25 00:27:03] [INFO ] [Nat]Added 1640 Read/Feed constraints in 178 ms returned sat
[2026-05-25 00:27:03] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 75 ms.
[2026-05-25 00:27:03] [INFO ] Added : 8 causal constraints over 2 iterations in 368 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 575 transition count 1767
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 575 transition count 1766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 574 transition count 1766
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 574 transition count 1766
Applied a total of 16 rules in 86 ms. Remains 574 /581 variables (removed 7) and now considering 1766/1773 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 574/581 places, 1766/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5999867302886054640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12847046647115065322.kers'
[2026-05-25 00:27:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5999867302886054640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12847046647115065322.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1766 rows 574 cols 3814 entries
Finished phase 1 with 532 SingleSign rule and 20 generalized
[2026-05-25 00:27:04] [INFO ] Computed 22 invariants in 8 ms
Computed 22 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12847046647115065322.kers
Total runtime 11 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9233 resets) in 4293 ms. (232 steps per ms)
BEST_FIRST walk for 1000001 steps (418 resets) in 702 ms. (1422 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:27:09] [INFO ] Invariant cache hit.
[2026-05-25 00:27:09] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:27:09] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:27:09] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2026-05-25 00:27:09] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2026-05-25 00:27:09] [INFO ] [Real]Added 1654 Read/Feed constraints in 133 ms returned sat
[2026-05-25 00:27:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:27:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:27:09] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 00:27:10] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2026-05-25 00:27:10] [INFO ] [Nat]Added 1654 Read/Feed constraints in 140 ms returned sat
[2026-05-25 00:27:10] [INFO ] Computed and/alt/rep : 1200/3598/1200 causal constraints (skipped 546 transitions) in 73 ms.
[2026-05-25 00:27:10] [INFO ] Added : 7 causal constraints over 2 iterations in 389 ms. Result :sat
Minimization took 3176 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 23 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 574/574 places, 1766/1766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 23 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
[2026-05-25 00:27:14] [INFO ] Invariant cache hit.
[2026-05-25 00:27:14] [INFO ] Implicit Places using invariants in 370 ms returned []
[2026-05-25 00:27:14] [INFO ] Invariant cache hit.
[2026-05-25 00:27:14] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2026-05-25 00:27:25] [INFO ] Implicit Places using invariants and state equation in 11093 ms returned []
Implicit Place search using SMT with State Equation took 11464 ms to find 0 implicit places.
[2026-05-25 00:27:25] [INFO ] Redundant transitions in 34 ms returned []
Running 1746 sub problems to find dead transitions.
[2026-05-25 00:27:25] [INFO ] Invariant cache hit.
[2026-05-25 00:27:25] [INFO ] State equation strengthened by 1654 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/2340 variables, and 62 constraints, problems are : Problem set: 0 solved, 1746 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/574 constraints, ReadFeed: 0/1654 constraints, PredecessorRefiner: 1746/1746 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2340 variables, and 146 constraints, problems are : Problem set: 0 solved, 1746 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/574 constraints, ReadFeed: 0/1654 constraints, PredecessorRefiner: 0/1746 constraints, Known Traps: 124/124 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60468ms problems are : Problem set: 0 solved, 1746 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72006 ms. Remains : 574/574 places, 1766/1766 transitions.
[2026-05-25 00:28:26] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:28:26] [INFO ] Flatten gal took : 19 ms
[2026-05-25 00:28:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17202861257168727667.gal : 5 ms
[2026-05-25 00:28:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16147157006542040341.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/ReachabilityCardinality17202861257168727667.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16147157006542040341.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
RANDOM walk for 40000 steps (360 resets) in 295 ms. (135 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16147157006542040341.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 248
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 304
Interrupted probabilistic random walk after 423662 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 2
Probabilistic random walk after 423662 steps, saw 54322 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2026-05-25 00:28:29] [INFO ] Invariant cache hit.
[2026-05-25 00:28:29] [INFO ] State equation strengthened by 1654 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1766/2338 variables, 572/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2338 variables, 1654/2250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :304 after 2761
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 0/2250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2340 variables, 2/2252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2340 variables, 0/2252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2340/2340 variables, and 2252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1766/2338 variables, 572/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 1654/2252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2338 variables, 2/2254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2338 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2340 variables, 2/2256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2340 variables, 0/2256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2340 variables, 0/2256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2340/2340 variables, and 2256 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2450 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4151ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 22 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 574/574 places, 1766/1766 transitions.
RANDOM walk for 40000 steps (369 resets) in 411 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2761 after 3940
Interrupted probabilistic random walk after 435980 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 2
Probabilistic random walk after 435980 steps, saw 55611 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2026-05-25 00:28:36] [INFO ] Invariant cache hit.
[2026-05-25 00:28:36] [INFO ] State equation strengthened by 1654 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3940 after 3964
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1766/2338 variables, 572/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3964 after 4012
At refinement iteration 10 (INCLUDED_ONLY) 0/2338 variables, 1654/2250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 0/2250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2340 variables, 2/2252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2340 variables, 0/2252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2340/2340 variables, and 2252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1766 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1766/2338 variables, 572/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 1654/2252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2338 variables, 2/2254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2338 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2340 variables, 2/2256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2340 variables, 0/2256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2340 variables, 0/2256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2340/2340 variables, and 2256 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3382 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5160ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 24 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 574/574 places, 1766/1766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 22 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
[2026-05-25 00:28:41] [INFO ] Invariant cache hit.
[2026-05-25 00:28:42] [INFO ] Implicit Places using invariants in 369 ms returned []
[2026-05-25 00:28:42] [INFO ] Invariant cache hit.
[2026-05-25 00:28:42] [INFO ] State equation strengthened by 1654 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4012 after 23816
[2026-05-25 00:28:53] [INFO ] Implicit Places using invariants and state equation in 11559 ms returned []
Implicit Place search using SMT with State Equation took 11946 ms to find 0 implicit places.
[2026-05-25 00:28:53] [INFO ] Redundant transitions in 34 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12012 ms. Remains : 574/574 places, 1766/1766 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1591 edges and 574 vertex of which 491 / 574 are part of one of the 2 SCC in 1 ms
Free SCC test removed 489 places
Drop transitions (Empty/Sink Transition effects.) removed 1266 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 1661 transitions.
Graph (complete) has 225 edges and 85 vertex of which 25 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 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 58 rules applied. Total rules applied 60 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 80 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 98 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 100 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 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 103 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 104 place count 4 transition count 5
Applied a total of 104 rules in 7 ms. Remains 4 /574 variables (removed 570) and now considering 5/1766 (removed 1761) 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-8594077387113859821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15462357439645794896.kers'
[2026-05-25 00:28:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8594077387113859821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15462357439645794896.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 00:28:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15462357439645794896.kers
Total runtime 0 ms.
[2026-05-25 00:28:53] [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 00:28:53] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:28:53] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:28:53] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:28:53] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:28:53] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:28:53] [INFO ] Flatten gal took : 1 ms
[2026-05-25 00:28:53] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:28:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4796989701409578339.gal : 1 ms
[2026-05-25 00:28:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14823951454119089714.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/ReachabilityCardinality4796989701409578339.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14823951454119089714.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/ReachabilityCardinality14823951454119089714.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
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,210,0.003609,4180,2,24,11,231,6,0,22,205,0
Total reachable state count : 210
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.003802,4232,2,5,11,231,7,0,25,205,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.003915,4232,2,5,11,231,8,0,27,205,0
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:28:53] [INFO ] Flatten gal took : 24 ms
[2026-05-25 00:28:53] [INFO ] Applying decomposition
[2026-05-25 00:28:53] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15457033729432005875.txt' '-o' '/tmp/graph15457033729432005875.bin' '-w' '/tmp/graph15457033729432005875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15457033729432005875.bin' '-l' '-1' '-v' '-w' '/tmp/graph15457033729432005875.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:28:54] [INFO ] Decomposing Gal with order
[2026-05-25 00:28:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:28:54] [INFO ] Removed a total of 1325 redundant transitions.
[2026-05-25 00:28:54] [INFO ] Flatten gal took : 60 ms
[2026-05-25 00:28:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 1522 labels/synchronizations in 25 ms.
[2026-05-25 00:28:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12464012513816640956.gal : 9 ms
[2026-05-25 00:28:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7447052109548601018.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/ReachabilityCardinality12464012513816640956.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7447052109548601018.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/ReachabilityCardinality7447052109548601018.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 33
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :33 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 33
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 33
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :33 after 366
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :366 after 10094
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :10094 after 484310
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :484310 after 2.20316e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-08 in 162022 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3372598387012555788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16266635565311750629.kers'
[2026-05-25 00:29:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3372598387012555788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16266635565311750629.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:29:44] [INFO ] Computed 22 invariants in 13 ms
Computed 22 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-16266635565311750629.kers
Total runtime 17 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (90 resets) in 50 ms. (196 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:29:44] [INFO ] Invariant cache hit.
[2026-05-25 00:29:44] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:29:44] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:29:44] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2026-05-25 00:29:44] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:29:44] [INFO ] [Real]Added 1640 Read/Feed constraints in 119 ms returned sat
[2026-05-25 00:29:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:29:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-25 00:29:44] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:29:45] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:29:45] [INFO ] [Nat]Added 1640 Read/Feed constraints in 201 ms returned sat
[2026-05-25 00:29:45] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 72 ms.
[2026-05-25 00:29:45] [INFO ] Added : 9 causal constraints over 2 iterations in 408 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 576 transition count 1768
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 576 transition count 1767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 575 transition count 1767
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 575 transition count 1767
Applied a total of 15 rules in 85 ms. Remains 575 /581 variables (removed 6) and now considering 1767/1773 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 575/581 places, 1767/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8037583793307488082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11986137674655066323.kers'
[2026-05-25 00:29:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8037583793307488082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11986137674655066323.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1767 rows 575 cols 3816 entries
Finished phase 1 with 533 SingleSign rule and 20 generalized
[2026-05-25 00:29:46] [INFO ] Computed 22 invariants in 16 ms
Computed 22 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-11986137674655066323.kers
Total runtime 17 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9226 resets) in 4587 ms. (217 steps per ms)
BEST_FIRST walk for 1000001 steps (422 resets) in 723 ms. (1381 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:29:51] [INFO ] Invariant cache hit.
[2026-05-25 00:29:51] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:29:51] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:29:52] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2026-05-25 00:29:52] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:29:52] [INFO ] [Real]Added 1653 Read/Feed constraints in 132 ms returned sat
[2026-05-25 00:29:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:29:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:29:52] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-25 00:29:52] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2026-05-25 00:29:52] [INFO ] [Nat]Added 1653 Read/Feed constraints in 132 ms returned sat
[2026-05-25 00:29:52] [INFO ] Computed and/alt/rep : 1201/3594/1201 causal constraints (skipped 546 transitions) in 72 ms.
[2026-05-25 00:29:53] [INFO ] Added : 9 causal constraints over 2 iterations in 376 ms. Result :sat
Minimization took 3390 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 22 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:29:56] [INFO ] Invariant cache hit.
[2026-05-25 00:29:57] [INFO ] Implicit Places using invariants in 375 ms returned []
[2026-05-25 00:29:57] [INFO ] Invariant cache hit.
[2026-05-25 00:29:57] [INFO ] State equation strengthened by 1653 read => feed constraints.
[2026-05-25 00:30:09] [INFO ] Implicit Places using invariants and state equation in 12503 ms returned []
Implicit Place search using SMT with State Equation took 12880 ms to find 0 implicit places.
[2026-05-25 00:30:09] [INFO ] Redundant transitions in 45 ms returned []
Running 1747 sub problems to find dead transitions.
[2026-05-25 00:30:09] [INFO ] Invariant cache hit.
[2026-05-25 00:30:09] [INFO ] State equation strengthened by 1653 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/2342 variables, and 62 constraints, problems are : Problem set: 0 solved, 1747 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/575 constraints, ReadFeed: 0/1653 constraints, PredecessorRefiner: 1747/1747 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1747 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/2342 variables, and 152 constraints, problems are : Problem set: 0 solved, 1747 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/575 constraints, ReadFeed: 0/1653 constraints, PredecessorRefiner: 0/1747 constraints, Known Traps: 130/130 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60436ms problems are : Problem set: 0 solved, 1747 unsolved
Search for dead transitions found 0 dead transitions in 60439ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73395 ms. Remains : 575/575 places, 1767/1767 transitions.
[2026-05-25 00:31:10] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:31:10] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:31:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9222997553549409146.gal : 5 ms
[2026-05-25 00:31:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5032998787759054256.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/ReachabilityCardinality9222997553549409146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5032998787759054256.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 (368 resets) in 342 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5032998787759054256.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 248
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 304
Interrupted probabilistic random walk after 435548 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 2
Probabilistic random walk after 435548 steps, saw 55575 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2026-05-25 00:31:13] [INFO ] Invariant cache hit.
[2026-05-25 00:31:13] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :304 after 2729
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1659 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6763ms, 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 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 27 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 575/575 places, 1767/1767 transitions.
RANDOM walk for 40000 steps (366 resets) in 312 ms. (127 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
BEST_FIRST walk for 40002 steps (13 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
SDD size :2729 after 3940
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3940 after 3964
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3964 after 4012
Interrupted probabilistic random walk after 432747 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 2
Probabilistic random walk after 432747 steps, saw 55293 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2026-05-25 00:31:23] [INFO ] Invariant cache hit.
[2026-05-25 00:31:23] [INFO ] State equation strengthened by 1653 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1653/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1767/2340 variables, 573/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2340 variables, 1653/2273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2340 variables, 2/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2342 variables, 2/2277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2342 variables, 0/2277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2342 variables, 0/2277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2342/2342 variables, and 2277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9278 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10912ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 22 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:31:34] [INFO ] Invariant cache hit.
[2026-05-25 00:31:34] [INFO ] Implicit Places using invariants in 386 ms returned []
[2026-05-25 00:31:34] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 8192
[2026-05-25 00:31:34] [INFO ] State equation strengthened by 1653 read => feed constraints.
SDD size :4012 after 23808
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :23808 after 24395
[2026-05-25 00:31:47] [INFO ] Implicit Places using invariants and state equation in 12603 ms returned []
Implicit Place search using SMT with State Equation took 13002 ms to find 0 implicit places.
[2026-05-25 00:31:47] [INFO ] Redundant transitions in 32 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13066 ms. Remains : 575/575 places, 1767/1767 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1592 edges and 575 vertex of which 492 / 575 are part of one of the 2 SCC in 0 ms
Free SCC test removed 490 places
Drop transitions (Empty/Sink Transition effects.) removed 1267 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 1662 transitions.
Graph (complete) has 225 edges and 85 vertex of which 25 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 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 58 rules applied. Total rules applied 60 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 80 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 98 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 100 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 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 103 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 104 place count 4 transition count 5
Applied a total of 104 rules in 6 ms. Remains 4 /575 variables (removed 571) and now considering 5/1767 (removed 1762) 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-9221327866944378201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14310730448703313420.kers'
[2026-05-25 00:31:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9221327866944378201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14310730448703313420.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 00:31:47] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14310730448703313420.kers
Total runtime 0 ms.
[2026-05-25 00:31:47] [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 00:31:47] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:31:47] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:31:47] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:31:47] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:31:47] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:31:47] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:31:47] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7352772563004618845.gal : 0 ms
[2026-05-25 00:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3896328365198201131.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/ReachabilityCardinality7352772563004618845.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3896328365198201131.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/ReachabilityCardinality3896328365198201131.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
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,210,0.00391,4180,2,24,11,231,6,0,22,205,0
Total reachable state count : 210
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.004229,4236,2,5,11,231,7,0,25,205,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.00442,4236,2,5,11,231,8,0,27,205,0
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:31:47] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:31:47] [INFO ] Applying decomposition
[2026-05-25 00:31:47] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12261286950128884949.txt' '-o' '/tmp/graph12261286950128884949.bin' '-w' '/tmp/graph12261286950128884949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12261286950128884949.bin' '-l' '-1' '-v' '-w' '/tmp/graph12261286950128884949.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:31:47] [INFO ] Decomposing Gal with order
[2026-05-25 00:31:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:31:47] [INFO ] Removed a total of 1324 redundant transitions.
[2026-05-25 00:31:47] [INFO ] Flatten gal took : 62 ms
[2026-05-25 00:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1522 labels/synchronizations in 24 ms.
[2026-05-25 00:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3777762933730813396.gal : 8 ms
[2026-05-25 00:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5016512969551215214.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/ReachabilityCardinality3777762933730813396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5016512969551215214.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/ReachabilityCardinality5016512969551215214.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 82
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :82 after 84
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :84 after 87
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :87 after 88
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :88 after 89
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :89 after 94
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :94 after 262
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :262 after 1660
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1660 after 12190
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :12190 after 244609
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :244609 after 5.74218e+06
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-09 in 173420 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6250840600722815915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3327097205628240846.kers'
[2026-05-25 00:32:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6250840600722815915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3327097205628240846.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:32:37] [INFO ] Computed 22 invariants in 15 ms
Computed 22 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-3327097205628240846.kers
Total runtime 19 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (88 resets) in 49 ms. (200 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:32:37] [INFO ] Invariant cache hit.
[2026-05-25 00:32:37] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:32:37] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 00:32:38] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2026-05-25 00:32:38] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:32:38] [INFO ] [Real]Added 1640 Read/Feed constraints in 114 ms returned sat
[2026-05-25 00:32:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:32:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:32:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:32:38] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2026-05-25 00:32:38] [INFO ] [Nat]Added 1640 Read/Feed constraints in 156 ms returned sat
[2026-05-25 00:32:38] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 73 ms.
[2026-05-25 00:32:39] [INFO ] Added : 7 causal constraints over 2 iterations in 359 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 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 575 transition count 1767
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 575 transition count 1766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 574 transition count 1766
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 574 transition count 1766
Applied a total of 16 rules in 89 ms. Remains 574 /581 variables (removed 7) and now considering 1766/1773 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 574/581 places, 1766/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-936014668325963185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6793413691011897439.kers'
[2026-05-25 00:32:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-936014668325963185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6793413691011897439.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1766 rows 574 cols 3814 entries
Finished phase 1 with 532 SingleSign rule and 20 generalized
[2026-05-25 00:32:39] [INFO ] Computed 22 invariants in 15 ms
Computed 22 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-6793413691011897439.kers
Total runtime 16 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9216 resets) in 4316 ms. (231 steps per ms)
BEST_FIRST walk for 1000001 steps (423 resets) in 718 ms. (1390 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:32:44] [INFO ] Invariant cache hit.
[2026-05-25 00:32:44] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:32:44] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:32:45] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2026-05-25 00:32:45] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2026-05-25 00:32:45] [INFO ] [Real]Added 1654 Read/Feed constraints in 138 ms returned sat
[2026-05-25 00:32:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:32:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:32:45] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:32:45] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2026-05-25 00:32:45] [INFO ] [Nat]Added 1654 Read/Feed constraints in 142 ms returned sat
[2026-05-25 00:32:45] [INFO ] Computed and/alt/rep : 1200/3598/1200 causal constraints (skipped 546 transitions) in 60 ms.
[2026-05-25 00:32:46] [INFO ] Added : 7 causal constraints over 2 iterations in 326 ms. Result :sat
Minimization took 3930 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 22 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 574/574 places, 1766/1766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 22 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
[2026-05-25 00:32:50] [INFO ] Invariant cache hit.
[2026-05-25 00:32:50] [INFO ] Implicit Places using invariants in 371 ms returned []
[2026-05-25 00:32:50] [INFO ] Invariant cache hit.
[2026-05-25 00:32:50] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2026-05-25 00:33:06] [INFO ] Implicit Places using invariants and state equation in 15580 ms returned []
Implicit Place search using SMT with State Equation took 15952 ms to find 0 implicit places.
[2026-05-25 00:33:06] [INFO ] Redundant transitions in 31 ms returned []
Running 1746 sub problems to find dead transitions.
[2026-05-25 00:33:06] [INFO ] Invariant cache hit.
[2026-05-25 00:33:06] [INFO ] State equation strengthened by 1654 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/2340 variables, and 62 constraints, problems are : Problem set: 0 solved, 1746 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/574 constraints, ReadFeed: 0/1654 constraints, PredecessorRefiner: 1746/1746 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2340 variables, and 169 constraints, problems are : Problem set: 0 solved, 1746 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/574 constraints, ReadFeed: 0/1654 constraints, PredecessorRefiner: 0/1746 constraints, Known Traps: 147/147 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60469ms problems are : Problem set: 0 solved, 1746 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76489 ms. Remains : 574/574 places, 1766/1766 transitions.
[2026-05-25 00:34:06] [INFO ] Flatten gal took : 25 ms
[2026-05-25 00:34:06] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:34:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7826094637289154989.gal : 6 ms
[2026-05-25 00:34:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14405594898226750834.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/ReachabilityCardinality7826094637289154989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14405594898226750834.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
RANDOM walk for 40000 steps (370 resets) in 358 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14405594898226750834.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 248
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 304
Interrupted probabilistic random walk after 430021 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 430021 steps, saw 54979 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2026-05-25 00:34:09] [INFO ] Invariant cache hit.
[2026-05-25 00:34:09] [INFO ] State equation strengthened by 1654 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
At refinement iteration 9 (OVERLAPS) 1766/2338 variables, 572/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :304 after 2735
At refinement iteration 10 (INCLUDED_ONLY) 0/2338 variables, 1654/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2340 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2340/2340 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2559 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1766/2338 variables, 572/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2338 variables, 1654/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2338 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/2340 variables, 2/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2340 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2340 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2340/2340 variables, and 2255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4632ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 23 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 574/574 places, 1766/1766 transitions.
RANDOM walk for 40000 steps (365 resets) in 338 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2735 after 3940
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3940 after 3964
Interrupted probabilistic random walk after 429154 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 429154 steps, saw 54902 distinct states, run finished after 3005 ms. (steps per millisecond=142 ) properties seen :0
[2026-05-25 00:34:17] [INFO ] Invariant cache hit.
[2026-05-25 00:34:17] [INFO ] State equation strengthened by 1654 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3964 after 4012
At refinement iteration 9 (OVERLAPS) 1766/2338 variables, 572/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2338 variables, 1654/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2340 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2340/2340 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1766/2338 variables, 572/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2338 variables, 1654/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2338 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/2340 variables, 2/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2340 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2340 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2340/2340 variables, and 2255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2673 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5158ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 29 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 574/574 places, 1766/1766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 22 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
[2026-05-25 00:34:22] [INFO ] Invariant cache hit.
[2026-05-25 00:34:23] [INFO ] Implicit Places using invariants in 397 ms returned []
[2026-05-25 00:34:23] [INFO ] Invariant cache hit.
[2026-05-25 00:34:23] [INFO ] State equation strengthened by 1654 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4012 after 23812
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :23812 after 24405
[2026-05-25 00:34:40] [INFO ] Implicit Places using invariants and state equation in 16717 ms returned []
Implicit Place search using SMT with State Equation took 17114 ms to find 0 implicit places.
[2026-05-25 00:34:40] [INFO ] Redundant transitions in 34 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17179 ms. Remains : 574/574 places, 1766/1766 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1591 edges and 574 vertex of which 491 / 574 are part of one of the 2 SCC in 0 ms
Free SCC test removed 489 places
Drop transitions (Empty/Sink Transition effects.) removed 1266 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 1661 transitions.
Graph (complete) has 225 edges and 85 vertex of which 25 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 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 58 rules applied. Total rules applied 60 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 24 transition count 28
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 80 place count 6 transition count 10
Iterating global reduction 2 with 18 rules applied. Total rules applied 98 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 100 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 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 103 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 104 place count 4 transition count 5
Applied a total of 104 rules in 6 ms. Remains 4 /574 variables (removed 570) and now considering 5/1766 (removed 1761) 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-15239931064007975039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17679219728025523047.kers'
[2026-05-25 00:34:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15239931064007975039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17679219728025523047.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 00:34:40] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17679219728025523047.kers
Total runtime 0 ms.
[2026-05-25 00:34:40] [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 00:34:40] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:34:40] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-25 00:34:40] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:34:40] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:34:40] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-25 00:34:40] [INFO ] Flatten gal took : 1 ms
[2026-05-25 00:34:40] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:34:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9319111067089815939.gal : 1 ms
[2026-05-25 00:34:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2164623992406411045.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/ReachabilityCardinality9319111067089815939.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2164623992406411045.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/ReachabilityCardinality2164623992406411045.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
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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,210,0.003993,4176,2,24,11,231,6,0,22,205,0
Total reachable state count : 210
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.004205,4232,2,5,11,231,7,0,25,205,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.004324,4232,2,5,11,231,8,0,27,205,0
Over-approximation ignoring read arcs solved 0 properties in 78 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:34:40] [INFO ] Flatten gal took : 19 ms
[2026-05-25 00:34:40] [INFO ] Applying decomposition
[2026-05-25 00:34:40] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph168554550830016021.txt' '-o' '/tmp/graph168554550830016021.bin' '-w' '/tmp/graph168554550830016021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph168554550830016021.bin' '-l' '-1' '-v' '-w' '/tmp/graph168554550830016021.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:34:40] [INFO ] Decomposing Gal with order
[2026-05-25 00:34:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:34:40] [INFO ] Removed a total of 1355 redundant transitions.
[2026-05-25 00:34:40] [INFO ] Flatten gal took : 59 ms
[2026-05-25 00:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 25 ms.
[2026-05-25 00:34:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16704247288368910155.gal : 9 ms
[2026-05-25 00:34:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7660415222124519428.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/ReachabilityCardinality16704247288368910155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7660415222124519428.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/ReachabilityCardinality7660415222124519428.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 26
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :26 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 26
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :26 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 26
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :26 after 26
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :26 after 26
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :26 after 294
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :294 after 582
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :582 after 19591
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :19591 after 230381
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :230381 after 2.10845e+06
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-10 in 172902 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12753298931322382047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5116037520334153670.kers'
[2026-05-25 00:35:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12753298931322382047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5116037520334153670.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:35:30] [INFO ] Computed 22 invariants in 18 ms
Computed 22 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5116037520334153670.kers
Total runtime 20 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (92 resets) in 50 ms. (196 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:35:30] [INFO ] Invariant cache hit.
[2026-05-25 00:35:30] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:35:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:35:30] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2026-05-25 00:35:31] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:35:31] [INFO ] [Real]Added 1640 Read/Feed constraints in 114 ms returned sat
[2026-05-25 00:35:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:35:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:35:31] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:35:31] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2026-05-25 00:35:31] [INFO ] [Nat]Added 1640 Read/Feed constraints in 193 ms returned sat
[2026-05-25 00:35:31] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 77 ms.
[2026-05-25 00:35:32] [INFO ] Added : 6 causal constraints over 2 iterations in 343 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 575 transition count 1767
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 575 transition count 1767
Applied a total of 15 rules in 77 ms. Remains 575 /581 variables (removed 6) and now considering 1767/1773 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 575/581 places, 1767/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15155363081422459989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8532956030381087075.kers'
[2026-05-25 00:35:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15155363081422459989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8532956030381087075.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1767 rows 575 cols 3780 entries
Finished phase 1 with 533 SingleSign rule and 20 generalized
[2026-05-25 00:35:32] [INFO ] Computed 22 invariants in 14 ms
Computed 22 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-8532956030381087075.kers
Total runtime 18 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9124 resets) in 4305 ms. (232 steps per ms)
BEST_FIRST walk for 1000001 steps (436 resets) in 715 ms. (1396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:35:37] [INFO ] Invariant cache hit.
[2026-05-25 00:35:37] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:35:37] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:35:38] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2026-05-25 00:35:38] [INFO ] State equation strengthened by 1655 read => feed constraints.
[2026-05-25 00:35:38] [INFO ] [Real]Added 1655 Read/Feed constraints in 146 ms returned sat
[2026-05-25 00:35:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:35:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:35:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:35:38] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2026-05-25 00:35:38] [INFO ] [Nat]Added 1655 Read/Feed constraints in 145 ms returned sat
[2026-05-25 00:35:38] [INFO ] Computed and/alt/rep : 1238/3694/1238 causal constraints (skipped 509 transitions) in 71 ms.
[2026-05-25 00:35:39] [INFO ] Added : 6 causal constraints over 2 iterations in 340 ms. Result :sat
Minimization took 4216 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 22 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 22 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:35:43] [INFO ] Invariant cache hit.
[2026-05-25 00:35:43] [INFO ] Implicit Places using invariants in 357 ms returned []
[2026-05-25 00:35:43] [INFO ] Invariant cache hit.
[2026-05-25 00:35:44] [INFO ] State equation strengthened by 1655 read => feed constraints.
[2026-05-25 00:35:57] [INFO ] Implicit Places using invariants and state equation in 13187 ms returned []
Implicit Place search using SMT with State Equation took 13547 ms to find 0 implicit places.
[2026-05-25 00:35:57] [INFO ] Redundant transitions in 32 ms returned []
Running 1747 sub problems to find dead transitions.
[2026-05-25 00:35:57] [INFO ] Invariant cache hit.
[2026-05-25 00:35:57] [INFO ] State equation strengthened by 1655 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/2342 variables, and 62 constraints, problems are : Problem set: 0 solved, 1747 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/575 constraints, ReadFeed: 0/1655 constraints, PredecessorRefiner: 1747/1747 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1747 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1747 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/2342 variables, and 139 constraints, problems are : Problem set: 0 solved, 1747 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/575 constraints, ReadFeed: 0/1655 constraints, PredecessorRefiner: 0/1747 constraints, Known Traps: 117/117 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60501ms problems are : Problem set: 0 solved, 1747 unsolved
Search for dead transitions found 0 dead transitions in 60505ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74115 ms. Remains : 575/575 places, 1767/1767 transitions.
[2026-05-25 00:36:57] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:36:57] [INFO ] Flatten gal took : 24 ms
[2026-05-25 00:36:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17480950513571112393.gal : 5 ms
[2026-05-25 00:36:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12222976823415414832.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/ReachabilityCardinality17480950513571112393.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12222976823415414832.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
RANDOM walk for 40000 steps (361 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12222976823415414832.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 31
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :31 after 48
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :48 after 310
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :310 after 366
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :366 after 430
Interrupted probabilistic random walk after 424524 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 2
Probabilistic random walk after 424524 steps, saw 54364 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2026-05-25 00:37:00] [INFO ] Invariant cache hit.
[2026-05-25 00:37:00] [INFO ] State equation strengthened by 1655 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1655/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1655/1655 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :430 after 4122
SMT process timed out in 7065ms, 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 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 26 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 575/575 places, 1767/1767 transitions.
RANDOM walk for 40000 steps (362 resets) in 295 ms. (135 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 413104 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 413104 steps, saw 53096 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2026-05-25 00:37:10] [INFO ] Invariant cache hit.
[2026-05-25 00:37:10] [INFO ] State equation strengthened by 1655 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1767/2340 variables, 573/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 1655/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/2342 variables, 2/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2342 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2342 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2342/2342 variables, and 2255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1655/1655 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 532/533 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/571 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/573 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4122 after 5817
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5817 after 5871
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1767/2340 variables, 573/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2340 variables, 1655/2274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2340 variables, 2/2276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2342 variables, 2/2278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2342 variables, 0/2278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2342 variables, 0/2278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2342/2342 variables, and 2278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8397 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 575/575 constraints, ReadFeed: 1655/1655 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10334ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 31 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 575/575 places, 1767/1767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1767/1767 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
[2026-05-25 00:37:21] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 8192
[2026-05-25 00:37:21] [INFO ] Implicit Places using invariants in 389 ms returned []
[2026-05-25 00:37:21] [INFO ] Invariant cache hit.
SDD size :5871 after 33462
[2026-05-25 00:37:22] [INFO ] State equation strengthened by 1655 read => feed constraints.
[2026-05-25 00:37:34] [INFO ] Implicit Places using invariants and state equation in 12958 ms returned []
Implicit Place search using SMT with State Equation took 13349 ms to find 0 implicit places.
[2026-05-25 00:37:34] [INFO ] Redundant transitions in 30 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13413 ms. Remains : 575/575 places, 1767/1767 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1595 edges and 575 vertex of which 492 / 575 are part of one of the 2 SCC in 1 ms
Free SCC test removed 490 places
Drop transitions (Empty/Sink Transition effects.) removed 1269 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 1664 transitions.
Graph (complete) has 224 edges and 85 vertex of which 26 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.0 ms
Discarding 59 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 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 57 rules applied. Total rules applied 59 place count 26 transition count 28
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 25 transition count 27
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 78 place count 8 transition count 10
Iterating global reduction 2 with 17 rules applied. Total rules applied 95 place count 8 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 97 place count 8 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 8 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 100 place count 7 transition count 6
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 5 transition count 4
Applied a total of 102 rules in 3 ms. Remains 5 /575 variables (removed 570) and now considering 4/1767 (removed 1763) 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-18183695458121102509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16019222807996361073.kers'
[2026-05-25 00:37:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18183695458121102509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16019222807996361073.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 5 cols 8 entries
Finished phase 1 with 3 SingleSign rule and 1 generalized
[2026-05-25 00:37:34] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16019222807996361073.kers
Total runtime 0 ms.
[2026-05-25 00:37:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:37:34] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:37:34] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2026-05-25 00:37:34] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2026-05-25 00:37:34] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:37:34] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:37:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9778051738625058311.gal : 0 ms
[2026-05-25 00:37:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10365087205634802332.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/ReachabilityCardinality9778051738625058311.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10365087205634802332.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/ReachabilityCardinality10365087205634802332.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 23
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 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,115,0.003174,4172,2,29,10,233,6,0,25,187,0
Total reachable state count : 115
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.003377,4220,2,6,10,233,7,0,28,187,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.003522,4220,2,6,10,233,8,0,29,187,0
Over-approximation ignoring read arcs solved 0 properties in 40 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:37:34] [INFO ] Flatten gal took : 19 ms
[2026-05-25 00:37:34] [INFO ] Applying decomposition
[2026-05-25 00:37:34] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3804222189710334739.txt' '-o' '/tmp/graph3804222189710334739.bin' '-w' '/tmp/graph3804222189710334739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3804222189710334739.bin' '-l' '-1' '-v' '-w' '/tmp/graph3804222189710334739.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:37:34] [INFO ] Decomposing Gal with order
[2026-05-25 00:37:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:37:35] [INFO ] Removed a total of 1358 redundant transitions.
[2026-05-25 00:37:35] [INFO ] Flatten gal took : 63 ms
[2026-05-25 00:37:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1436 labels/synchronizations in 22 ms.
[2026-05-25 00:37:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10552840948108983373.gal : 9 ms
[2026-05-25 00:37:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7059828929637516685.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/ReachabilityCardinality10552840948108983373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7059828929637516685.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/ReachabilityCardinality7059828929637516685.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 857
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :857 after 857
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :857 after 949
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :949 after 1984
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :95557 after 174879
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.60051e+06 after 8.71163e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8.71163e+06 after 1.19935e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-11 in 174623 ms.
Starting property specific reduction for CANInsertWithFailure-PT-020-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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12379421106084668137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13556163108008731755.kers'
[2026-05-25 00:38:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12379421106084668137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13556163108008731755.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1773 rows 581 cols 3792 entries
Finished phase 1 with 539 SingleSign rule and 20 generalized
[2026-05-25 00:38:25] [INFO ] Computed 22 invariants in 14 ms
Computed 22 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-13556163108008731755.kers
Total runtime 19 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (91 resets) in 49 ms. (200 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:38:25] [INFO ] Invariant cache hit.
[2026-05-25 00:38:25] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:38:25] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:38:25] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2026-05-25 00:38:25] [INFO ] State equation strengthened by 1640 read => feed constraints.
[2026-05-25 00:38:25] [INFO ] [Real]Added 1640 Read/Feed constraints in 119 ms returned sat
[2026-05-25 00:38:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:38:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 00:38:25] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:38:26] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2026-05-25 00:38:26] [INFO ] [Nat]Added 1640 Read/Feed constraints in 207 ms returned sat
[2026-05-25 00:38:26] [INFO ] Computed and/alt/rep : 1246/3671/1246 causal constraints (skipped 507 transitions) in 75 ms.
[2026-05-25 00:38:26] [INFO ] Added : 10 causal constraints over 2 iterations in 344 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1773/1773 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 575 transition count 1767
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 575 transition count 1766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 574 transition count 1766
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 574 transition count 1766
Applied a total of 16 rules in 85 ms. Remains 574 /581 variables (removed 7) and now considering 1766/1773 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 574/581 places, 1766/1773 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12860597462607890876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6652692711184595186.kers'
[2026-05-25 00:38:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12860597462607890876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6652692711184595186.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1766 rows 574 cols 3814 entries
Finished phase 1 with 532 SingleSign rule and 20 generalized
[2026-05-25 00:38:27] [INFO ] Computed 22 invariants in 14 ms
Computed 22 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-6652692711184595186.kers
Total runtime 18 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[18]
RANDOM walk for 1000000 steps (9218 resets) in 4360 ms. (229 steps per ms)
BEST_FIRST walk for 1000001 steps (420 resets) in 711 ms. (1404 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[18]
[2026-05-25 00:38:32] [INFO ] Invariant cache hit.
[2026-05-25 00:38:32] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:38:32] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:38:32] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2026-05-25 00:38:32] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2026-05-25 00:38:32] [INFO ] [Real]Added 1654 Read/Feed constraints in 138 ms returned sat
[2026-05-25 00:38:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:38:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-25 00:38:33] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 00:38:33] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2026-05-25 00:38:33] [INFO ] [Nat]Added 1654 Read/Feed constraints in 141 ms returned sat
[2026-05-25 00:38:33] [INFO ] Computed and/alt/rep : 1200/3598/1200 causal constraints (skipped 546 transitions) in 72 ms.
[2026-05-25 00:38:33] [INFO ] Added : 7 causal constraints over 2 iterations in 344 ms. Result :sat
Minimization took 4306 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[18]
Support contains 1 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 22 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 574/574 places, 1766/1766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 22 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
[2026-05-25 00:38:38] [INFO ] Invariant cache hit.
[2026-05-25 00:38:38] [INFO ] Implicit Places using invariants in 373 ms returned []
[2026-05-25 00:38:38] [INFO ] Invariant cache hit.
[2026-05-25 00:38:38] [INFO ] State equation strengthened by 1654 read => feed constraints.
[2026-05-25 00:38:53] [INFO ] Implicit Places using invariants and state equation in 14755 ms returned []
Implicit Place search using SMT with State Equation took 15131 ms to find 0 implicit places.
[2026-05-25 00:38:53] [INFO ] Redundant transitions in 31 ms returned []
Running 1746 sub problems to find dead transitions.
[2026-05-25 00:38:53] [INFO ] Invariant cache hit.
[2026-05-25 00:38:53] [INFO ] State equation strengthened by 1654 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/2340 variables, and 62 constraints, problems are : Problem set: 0 solved, 1746 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/574 constraints, ReadFeed: 0/1654 constraints, PredecessorRefiner: 1746/1746 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2340 variables, and 222 constraints, problems are : Problem set: 0 solved, 1746 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/574 constraints, ReadFeed: 0/1654 constraints, PredecessorRefiner: 0/1746 constraints, Known Traps: 200/200 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60480ms problems are : Problem set: 0 solved, 1746 unsolved
Search for dead transitions found 0 dead transitions in 60483ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75681 ms. Remains : 574/574 places, 1766/1766 transitions.
[2026-05-25 00:39:53] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:39:53] [INFO ] Flatten gal took : 19 ms
[2026-05-25 00:39:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality789783020937114597.gal : 5 ms
[2026-05-25 00:39:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17652970257804174093.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/ReachabilityCardinality789783020937114597.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17652970257804174093.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 (368 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17652970257804174093.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 23
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :23 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 248
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :248 after 304
Interrupted probabilistic random walk after 431763 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 431763 steps, saw 55192 distinct states, run finished after 3002 ms. (steps per millisecond=143 ) properties seen :0
[2026-05-25 00:39:57] [INFO ] Invariant cache hit.
[2026-05-25 00:39:57] [INFO ] State equation strengthened by 1654 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1766/2338 variables, 572/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :304 after 2735
At refinement iteration 10 (INCLUDED_ONLY) 0/2338 variables, 1654/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2340 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2340/2340 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2005 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1766/2338 variables, 572/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 1654/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2338 variables, 2/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2338 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2340 variables, 2/2257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2340 variables, 0/2257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2340 variables, 0/2257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2340/2340 variables, and 2257 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2501 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4542ms 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 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 23 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 574/574 places, 1766/1766 transitions.
RANDOM walk for 40000 steps (361 resets) in 380 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2735 after 3940
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3940 after 3964
Interrupted probabilistic random walk after 437595 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 2
Probabilistic random walk after 437595 steps, saw 55769 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2026-05-25 00:40:04] [INFO ] Invariant cache hit.
[2026-05-25 00:40:04] [INFO ] State equation strengthened by 1654 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3964 after 4012
At refinement iteration 9 (OVERLAPS) 1766/2338 variables, 572/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2338 variables, 1654/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2340 variables, 2/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2340 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2340/2340 variables, and 2253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2194 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 531/532 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/570 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/572 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1766/2338 variables, 572/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2338 variables, 1654/2253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2338 variables, 2/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2338 variables, 0/2255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2340 variables, 2/2257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2340 variables, 0/2257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2340 variables, 0/2257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2340/2340 variables, and 2257 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4581 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 574/574 constraints, ReadFeed: 1654/1654 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6804ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 23 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 574/574 places, 1766/1766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1766/1766 transitions.
Applied a total of 0 rules in 23 ms. Remains 574 /574 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
[2026-05-25 00:40:11] [INFO ] Invariant cache hit.
[2026-05-25 00:40:12] [INFO ] Implicit Places using invariants in 385 ms returned []
[2026-05-25 00:40:12] [INFO ] Invariant cache hit.
[2026-05-25 00:40:12] [INFO ] State equation strengthened by 1654 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4012 after 23812
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :23812 after 24411
[2026-05-25 00:40:27] [INFO ] Implicit Places using invariants and state equation in 15482 ms returned []
Implicit Place search using SMT with State Equation took 15878 ms to find 0 implicit places.
[2026-05-25 00:40:27] [INFO ] Redundant transitions in 31 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15941 ms. Remains : 574/574 places, 1766/1766 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1592 edges and 574 vertex of which 490 / 574 are part of one of the 2 SCC in 0 ms
Free SCC test removed 488 places
Drop transitions (Empty/Sink Transition effects.) removed 1264 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 1659 transitions.
Graph (complete) has 228 edges and 86 vertex of which 26 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 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 59 rules applied. Total rules applied 61 place count 26 transition count 30
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 25 transition count 28
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 66 place count 24 transition count 27
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 84 place count 6 transition count 9
Iterating global reduction 3 with 18 rules applied. Total rules applied 102 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 6 transition count 7
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 4 transition count 4
Applied a total of 108 rules in 8 ms. Remains 4 /574 variables (removed 570) and now considering 4/1766 (removed 1762) 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-17160435309531228557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12017152752027045050.kers'
[2026-05-25 00:40:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17160435309531228557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12017152752027045050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 4 cols 8 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 00:40:27] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12017152752027045050.kers
Total runtime 0 ms.
[2026-05-25 00:40:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 00:40:27] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 00:40:27] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2026-05-25 00:40:27] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2026-05-25 00:40:27] [INFO ] Flatten gal took : 0 ms
[2026-05-25 00:40:27] [INFO ] Flatten gal took : 1 ms
[2026-05-25 00:40:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2292637107047806817.gal : 0 ms
[2026-05-25 00:40:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9332656761920292230.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/ReachabilityCardinality2292637107047806817.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9332656761920292230.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/ReachabilityCardinality9332656761920292230.prop.
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 13
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 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,60,0.003252,4180,2,28,11,194,6,0,22,130,0
Total reachable state count : 60
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.003427,4220,2,5,11,194,7,0,25,130,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.00354,4224,2,5,11,194,8,0,27,130,0
Over-approximation ignoring read arcs solved 0 properties in 129 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 00:40:27] [INFO ] Flatten gal took : 20 ms
[2026-05-25 00:40:27] [INFO ] Applying decomposition
[2026-05-25 00:40:27] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12482833776429481531.txt' '-o' '/tmp/graph12482833776429481531.bin' '-w' '/tmp/graph12482833776429481531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12482833776429481531.bin' '-l' '-1' '-v' '-w' '/tmp/graph12482833776429481531.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:40:27] [INFO ] Decomposing Gal with order
[2026-05-25 00:40:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:40:27] [INFO ] Removed a total of 1360 redundant transitions.
[2026-05-25 00:40:27] [INFO ] Flatten gal took : 56 ms
[2026-05-25 00:40:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1432 labels/synchronizations in 23 ms.
[2026-05-25 00:40:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2263554809474841961.gal : 9 ms
[2026-05-25 00:40:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1302000318235244980.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/ReachabilityCardinality2263554809474841961.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1302000318235244980.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/ReachabilityCardinality1302000318235244980.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 41
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :41 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 41
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :41 after 41
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :41 after 41
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :41 after 1693
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1693 after 2239
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2239 after 76879
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :76879 after 2.08708e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.08708e+06 after 2.38933e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.38933e+06 after 3.98825e+07
Detected timeout of ITS tools.
Ending property specific reduction for CANInsertWithFailure-PT-020-UpperBounds-12 in 172881 ms.
[2026-05-25 00:41:18] [INFO ] Flatten gal took : 19 ms
[2026-05-25 00:41:18] [INFO ] Applying decomposition
[2026-05-25 00:41:18] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16169079154675452310.txt' '-o' '/tmp/graph16169079154675452310.bin' '-w' '/tmp/graph16169079154675452310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16169079154675452310.bin' '-l' '-1' '-v' '-w' '/tmp/graph16169079154675452310.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:41:18] [INFO ] Decomposing Gal with order
[2026-05-25 00:41:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:41:18] [INFO ] Removed a total of 1345 redundant transitions.
[2026-05-25 00:41:18] [INFO ] Flatten gal took : 59 ms
[2026-05-25 00:41:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1368 labels/synchronizations in 22 ms.
[2026-05-25 00:41:18] [INFO ] Time to serialize gal into /tmp/UpperBounds2977017128606812549.gal : 8 ms
[2026-05-25 00:41:18] [INFO ] Time to serialize properties into /tmp/UpperBounds1627770757849794525.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/UpperBounds2977017128606812549.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1627770757849794525.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 ...283
Loading property file /tmp/UpperBounds1627770757849794525.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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-020"
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-020, 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-177946842100717"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-020.tgz
mv CANInsertWithFailure-PT-020 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 ;