About the Execution of ITS-Tools for SafeBus-COL-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 1 ? 1 1 15 1 1 15 ? 1 1 1 ? 15 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264700733.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SafeBus-COL-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264700733
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 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 SafeBus-COL-15-UpperBounds-00
FORMULA_NAME SafeBus-COL-15-UpperBounds-01
FORMULA_NAME SafeBus-COL-15-UpperBounds-02
FORMULA_NAME SafeBus-COL-15-UpperBounds-03
FORMULA_NAME SafeBus-COL-15-UpperBounds-04
FORMULA_NAME SafeBus-COL-15-UpperBounds-05
FORMULA_NAME SafeBus-COL-15-UpperBounds-06
FORMULA_NAME SafeBus-COL-15-UpperBounds-07
FORMULA_NAME SafeBus-COL-15-UpperBounds-08
FORMULA_NAME SafeBus-COL-15-UpperBounds-09
FORMULA_NAME SafeBus-COL-15-UpperBounds-10
FORMULA_NAME SafeBus-COL-15-UpperBounds-11
FORMULA_NAME SafeBus-COL-15-UpperBounds-12
FORMULA_NAME SafeBus-COL-15-UpperBounds-13
FORMULA_NAME SafeBus-COL-15-UpperBounds-14
FORMULA_NAME SafeBus-COL-15-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749162286160
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-05 22:24:47] [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]
[2025-06-05 22:24:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 22:24:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-05 22:24:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 22:24:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2025-06-05 22:24:48] [INFO ] Detected 1 constant HL places corresponding to 15 PT places.
[2025-06-05 22:24:48] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 636 PT places and 59206.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-05 22:24:48] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2025-06-05 22:24:48] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2025-06-05 22:24:48] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 15, 1, 0] Max Struct:[1, 15, 1, 5, 15, 1, 3, 15, 15, 1, 1, 1, 15, 15, 1, 1]
FORMULA SafeBus-COL-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-13 15 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-05 22:24:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-05 22:24:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 22:24:48] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-05 22:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 22:24:48] [INFO ] Added : 12 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-05 22:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-05 22:24:48] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 22:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 22:24:48] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-05 22:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 22:24:48] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 22:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 22:24:48] [INFO ] Added : 11 causal constraints over 4 iterations in 13 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-05 22:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 22:24:48] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 22:24:48] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 22:24:48] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 22:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-05 22:24:49] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 22:24:49] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 22:24:49] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 22:24:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 22:24:49] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 22:24:49] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-05 22:24:49] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 22:24:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 22:24:49] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-05 22:24:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 22:24:49] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-05 22:24:49] [INFO ] Added : 9 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 15, 5, 15, 1, 3, 15, 15, 1, 1, 15, 1]
Domain [It(15), It(15)] of place AMC breaks symmetries in sort It
[2025-06-05 22:24:49] [INFO ] Unfolded HLPN to a Petri net with 636 places and 4801 transitions 34264 arcs in 106 ms.
[2025-06-05 22:24:49] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 15 places in 8 ms
Reduce places removed 30 places and 30 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[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]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 15, 5, 15, 1, 3, 15, 15, 1, 1, 15, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 15, 5, 15, 1, 3, 15, 15, 1, 1, 15, 1]
[2025-06-05 22:24:49] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2025-06-05 22:24:49] [INFO ] Computed 65 invariants in 85 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 15, 5, 15, 1, 3, 15, 15, 1, 1, 15, 1]
RANDOM walk for 10000 steps (2 resets) in 394 ms. (25 steps per ms)
FORMULA SafeBus-COL-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-07 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-04 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 278 ms. (179 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 1, 14, 14] Max Struct:[15, 5, 3, 15, 15]
[2025-06-05 22:24:50] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-05 22:24:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:50] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2025-06-05 22:24:50] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2025-06-05 22:24:50] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2025-06-05 22:24:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:24:50] [INFO ] [Real]Added 241 Read/Feed constraints in 97 ms returned sat
[2025-06-05 22:24:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2025-06-05 22:24:51] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 13 ms returned sat
[2025-06-05 22:24:51] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2025-06-05 22:24:52] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 22:24:52] [INFO ] [Nat]Added 241 Read/Feed constraints in 775 ms returned sat
[2025-06-05 22:24:52] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 356 ms.
[2025-06-05 22:24:52] [INFO ] Added : 2 causal constraints over 2 iterations in 619 ms. Result :sat
Minimization took 805 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:53] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2025-06-05 22:24:53] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:53] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-05 22:24:53] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 9 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:54] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-05 22:24:54] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2025-06-05 22:24:54] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2025-06-05 22:24:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2025-06-05 22:24:54] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2025-06-05 22:24:55] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2025-06-05 22:24:55] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 22:24:56] [INFO ] [Nat]Added 241 Read/Feed constraints in 1066 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:56] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-05 22:24:56] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 16 ms returned sat
[2025-06-05 22:24:56] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2025-06-05 22:24:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:24:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2025-06-05 22:24:56] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 16 ms returned sat
[2025-06-05 22:24:57] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2025-06-05 22:24:58] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 22:24:58] [INFO ] [Nat]Added 241 Read/Feed constraints in 1054 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 1, 14, 14] Max Struct:[15, 1, 1, 15, 15]
FORMULA SafeBus-COL-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 14, 14] Max Struct:[15, 15, 15]
Support contains 45 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1345 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1359 ms. Remains : 606/606 places, 4771/4771 transitions.
[2025-06-05 22:24:59] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-05 22:24:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 14, 14] Max Struct:[15, 15, 15]
RANDOM walk for 1000000 steps (2 resets) in 12861 ms. (77 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 8210 ms. (365 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
[2025-06-05 22:25:21] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-05 22:25:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:25:21] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-06-05 22:25:21] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2025-06-05 22:25:21] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2025-06-05 22:25:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:25:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-05 22:25:21] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2025-06-05 22:25:22] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2025-06-05 22:25:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:25:23] [INFO ] [Nat]Added 241 Read/Feed constraints in 967 ms returned sat
[2025-06-05 22:25:23] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 186 ms.
[2025-06-05 22:25:23] [INFO ] Added : 0 causal constraints over 0 iterations in 343 ms. Result :sat
Minimization took 2832 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:25:26] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2025-06-05 22:25:26] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 17 ms returned sat
[2025-06-05 22:25:27] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2025-06-05 22:25:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:25:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-05 22:25:27] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2025-06-05 22:25:27] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2025-06-05 22:25:32] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 22:25:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 6702 ms returned sat
[2025-06-05 22:25:34] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 155 ms.
[2025-06-05 22:25:35] [INFO ] Added : 1 causal constraints over 1 iterations in 471 ms. Result :sat
Minimization took 2257 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:25:37] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-05 22:25:37] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2025-06-05 22:25:37] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2025-06-05 22:25:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:25:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-05 22:25:38] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2025-06-05 22:25:38] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2025-06-05 22:25:41] [INFO ] [Nat]Added 241 Read/Feed constraints in 2776 ms returned sat
[2025-06-05 22:25:41] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 148 ms.
[2025-06-05 22:25:41] [INFO ] Added : 0 causal constraints over 0 iterations in 285 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
Support contains 45 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1006 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1006 ms. Remains : 606/606 places, 4771/4771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1062 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2025-06-05 22:25:50] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-05 22:25:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:25:51] [INFO ] Implicit Places using invariants in 1363 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1375 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 591/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1313 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3754 ms. Remains : 591/606 places, 4771/4771 transitions.
[2025-06-05 22:25:53] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2025-06-05 22:25:53] [INFO ] Computed 50 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
RANDOM walk for 1000000 steps (2 resets) in 12151 ms. (82 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 7901 ms. (379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
[2025-06-05 22:26:13] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-05 22:26:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:26:13] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-05 22:26:13] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2025-06-05 22:26:13] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-06-05 22:26:13] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:26:13] [INFO ] [Real]Added 241 Read/Feed constraints in 246 ms returned sat
[2025-06-05 22:26:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:26:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2025-06-05 22:26:14] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned sat
[2025-06-05 22:26:14] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-06-05 22:26:15] [INFO ] [Nat]Added 241 Read/Feed constraints in 924 ms returned sat
[2025-06-05 22:26:15] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 130 ms.
[2025-06-05 22:26:15] [INFO ] Added : 0 causal constraints over 0 iterations in 289 ms. Result :sat
Minimization took 6095 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:26:21] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2025-06-05 22:26:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 21 ms returned sat
[2025-06-05 22:26:22] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2025-06-05 22:26:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:26:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-05 22:26:22] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned sat
[2025-06-05 22:26:23] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2025-06-05 22:26:27] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 22:26:28] [INFO ] [Nat]Added 241 Read/Feed constraints in 5550 ms returned sat
[2025-06-05 22:26:28] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 131 ms.
[2025-06-05 22:26:28] [INFO ] Added : 0 causal constraints over 0 iterations in 275 ms. Result :sat
Minimization took 6094 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:26:35] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:26:35] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned sat
[2025-06-05 22:26:35] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2025-06-05 22:26:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:26:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:26:35] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned sat
[2025-06-05 22:26:36] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2025-06-05 22:26:40] [INFO ] [Nat]Added 241 Read/Feed constraints in 3766 ms returned sat
[2025-06-05 22:26:40] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 141 ms.
[2025-06-05 22:26:40] [INFO ] Added : 0 causal constraints over 0 iterations in 259 ms. Result :sat
Minimization took 6070 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
Support contains 45 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 958 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 958 ms. Remains : 591/591 places, 4771/4771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 956 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2025-06-05 22:26:48] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-05 22:26:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:26:49] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2025-06-05 22:26:49] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-05 22:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:26:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:26:58] [INFO ] Implicit Places using invariants and state equation in 9295 ms returned []
Implicit Place search using SMT with State Equation took 10487 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:26:59] [INFO ] Redundant transitions in 356 ms returned []
Running 4756 sub problems to find dead transitions.
[2025-06-05 22:26:59] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2025-06-05 22:26:59] [INFO ] Invariant cache hit.
[2025-06-05 22:26:59] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 15 solved, 4741 unsolved
SMT process timed out in 37490ms, After SMT, problems are : Problem set: 15 solved, 4741 unsolved
Search for dead transitions found 15 dead transitions in 37538ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 591/591 places, 4756/4771 transitions.
Applied a total of 0 rules in 925 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:27:38] [INFO ] Redundant transitions in 327 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50638 ms. Remains : 591/591 places, 4756/4771 transitions.
[2025-06-05 22:27:38] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:27:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
RANDOM walk for 1000000 steps (2 resets) in 12160 ms. (82 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 7808 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
[2025-06-05 22:27:58] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:27:58] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2025-06-05 22:27:58] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned sat
[2025-06-05 22:27:58] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2025-06-05 22:27:58] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:27:58] [INFO ] [Real]Added 241 Read/Feed constraints in 246 ms returned sat
[2025-06-05 22:27:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:27:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-05 22:27:58] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2025-06-05 22:27:59] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2025-06-05 22:28:00] [INFO ] [Nat]Added 241 Read/Feed constraints in 1002 ms returned sat
[2025-06-05 22:28:00] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 123 ms.
[2025-06-05 22:28:00] [INFO ] Added : 0 causal constraints over 0 iterations in 285 ms. Result :sat
Minimization took 6054 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:28:06] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-05 22:28:06] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned sat
[2025-06-05 22:28:07] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2025-06-05 22:28:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:28:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-05 22:28:07] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned sat
[2025-06-05 22:28:07] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2025-06-05 22:28:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 2002 ms returned sat
[2025-06-05 22:28:10] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 125 ms.
[2025-06-05 22:28:10] [INFO ] Added : 0 causal constraints over 0 iterations in 289 ms. Result :sat
Minimization took 6062 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:28:16] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-05 22:28:16] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2025-06-05 22:28:16] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2025-06-05 22:28:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:28:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:28:16] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2025-06-05 22:28:17] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2025-06-05 22:28:21] [INFO ] [Nat]Added 241 Read/Feed constraints in 3982 ms returned sat
[2025-06-05 22:28:21] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 126 ms.
[2025-06-05 22:28:22] [INFO ] Added : 1 causal constraints over 1 iterations in 321 ms. Result :sat
Minimization took 6078 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
Support contains 45 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 953 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 953 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 927 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2025-06-05 22:28:29] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:28:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:28:31] [INFO ] Implicit Places using invariants in 1211 ms returned []
[2025-06-05 22:28:31] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:28:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:28:31] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:28:38] [INFO ] Implicit Places using invariants and state equation in 7094 ms returned []
Implicit Place search using SMT with State Equation took 8307 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:28:38] [INFO ] Redundant transitions in 214 ms returned []
Running 4741 sub problems to find dead transitions.
[2025-06-05 22:28:38] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:28:38] [INFO ] Invariant cache hit.
[2025-06-05 22:28:38] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 36790ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 36804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46273 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 2192 ms. (18 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 444 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
[2025-06-05 22:29:16] [INFO ] Flatten gal took : 995 ms
BEST_FIRST walk for 40003 steps (8 resets) in 482 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 397 ms. (100 steps per ms) remains 6/6 properties
[2025-06-05 22:29:16] [INFO ] Flatten gal took : 341 ms
[2025-06-05 22:29:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10723895211023216989.gal : 96 ms
[2025-06-05 22:29:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11111596032826973597.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10723895211023216989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11111596032826973597.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11111596032826973597.prop.
Interrupted probabilistic random walk after 117503 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 6
Probabilistic random walk after 117503 steps, saw 68895 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :0
[2025-06-05 22:29:19] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:29:19] [INFO ] Invariant cache hit.
[2025-06-05 22:29:19] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 1 (OVERLAPS) 484/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :12 after 34
[2025-06-05 22:29:20] [INFO ] Deduced a trap composed of 46 places in 644 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:21] [INFO ] Deduced a trap composed of 46 places in 457 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :34 after 57
[2025-06-05 22:29:21] [INFO ] Deduced a trap composed of 46 places in 374 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:22] [INFO ] Deduced a trap composed of 46 places in 406 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:22] [INFO ] Deduced a trap composed of 302 places in 451 ms of which 77 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 5/21 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :57 after 158
[2025-06-05 22:29:23] [INFO ] Deduced a trap composed of 309 places in 339 ms of which 72 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 58/588 variables, 31/54 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/589 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1411/2000 variables, 589/644 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 240/884 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/2003 variables, and 884 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 589/591 constraints, ReadFeed: 240/241 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 484/529 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 6/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:25] [INFO ] Deduced a trap composed of 46 places in 601 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:25] [INFO ] Deduced a trap composed of 61 places in 396 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:26] [INFO ] Deduced a trap composed of 61 places in 387 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:26] [INFO ] Deduced a trap composed of 61 places in 374 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :158 after 320
[2025-06-05 22:29:27] [INFO ] Deduced a trap composed of 61 places in 387 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:27] [INFO ] Deduced a trap composed of 61 places in 392 ms of which 54 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 6/28 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/530 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 58/588 variables, 31/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:28] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 59 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 1/61 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/589 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1411/2000 variables, 589/651 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 240/891 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/2003 variables, and 894 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 589/591 constraints, ReadFeed: 240/241 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10110ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 939 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 940 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 958 ms. (41 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 5/5 properties
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :320 after 1103
Interrupted probabilistic random walk after 131948 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 5
Probabilistic random walk after 131948 steps, saw 76916 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2025-06-05 22:29:34] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:29:34] [INFO ] Invariant cache hit.
[2025-06-05 22:29:34] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 484/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:35] [INFO ] Deduced a trap composed of 46 places in 452 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:35] [INFO ] Deduced a trap composed of 61 places in 482 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:36] [INFO ] Deduced a trap composed of 61 places in 488 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:36] [INFO ] Deduced a trap composed of 61 places in 404 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:37] [INFO ] Deduced a trap composed of 61 places in 417 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:37] [INFO ] Deduced a trap composed of 61 places in 411 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:38] [INFO ] Deduced a trap composed of 61 places in 407 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:38] [INFO ] Deduced a trap composed of 61 places in 396 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:38] [INFO ] Deduced a trap composed of 61 places in 394 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:39] [INFO ] Deduced a trap composed of 309 places in 366 ms of which 74 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 58/588 variables, 31/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/589 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1411/2000 variables, 589/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2000 variables, 240/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/2003 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2003 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2003 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2003 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 892 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8013 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 484/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:42] [INFO ] Deduced a trap composed of 61 places in 393 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:43] [INFO ] Deduced a trap composed of 61 places in 404 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:29:43] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 52 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/530 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 58/588 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/589 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1411/2000 variables, 589/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 240/891 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 3/894 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2000 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/2003 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1103 after 5316
At refinement iteration 18 (INCLUDED_ONLY) 0/2003 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/2003 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 898 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7400 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15447ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6989 ms.
Support contains 45 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 931 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 931 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 927 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2025-06-05 22:29:58] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:29:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:29:59] [INFO ] Implicit Places using invariants in 1209 ms returned []
[2025-06-05 22:29:59] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:29:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:30:00] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:30:07] [INFO ] Implicit Places using invariants and state equation in 7117 ms returned []
Implicit Place search using SMT with State Equation took 8339 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:30:07] [INFO ] Redundant transitions in 204 ms returned []
Running 4741 sub problems to find dead transitions.
[2025-06-05 22:30:07] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:30:07] [INFO ] Invariant cache hit.
[2025-06-05 22:30:07] [INFO ] State equation strengthened by 241 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-05 22:30:07] [INFO ] Flatten gal took : 265 ms
[2025-06-05 22:30:07] [INFO ] Applying decomposition
[2025-06-05 22:30:08] [INFO ] Flatten gal took : 343 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6491728784108823272.txt' '-o' '/tmp/graph6491728784108823272.bin' '-w' '/tmp/graph6491728784108823272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6491728784108823272.bin' '-l' '-1' '-v' '-w' '/tmp/graph6491728784108823272.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:30:09] [INFO ] Decomposing Gal with order
[2025-06-05 22:30:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:30:13] [INFO ] Removed a total of 6261 redundant transitions.
[2025-06-05 22:30:14] [INFO ] Flatten gal took : 4706 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
[2025-06-05 22:30:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 8672 labels/synchronizations in 537 ms.
[2025-06-05 22:30:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2332158714314856247.gal : 31 ms
[2025-06-05 22:30:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17068171451604796475.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2332158714314856247.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17068171451604796475.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17068171451604796475.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :29 after 533
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :533 after 7547
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :7547 after 8051
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :8051 after 8321
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :8321 after 12749
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :12749 after 16979
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :16979 after 119039
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 37790ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 37805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47293 ms. Remains : 591/591 places, 4756/4756 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3344 transitions
Reduce isomorphic transitions removed 3344 transitions.
Iterating post reduction 0 with 3344 rules applied. Total rules applied 3344 place count 591 transition count 1412
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 3539 place count 396 transition count 1217
Iterating global reduction 1 with 195 rules applied. Total rules applied 3734 place count 396 transition count 1217
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 3737 place count 394 transition count 1216
Graph (trivial) has 46 edges and 394 vertex of which 17 / 394 are part of one of the 1 SCC in 1 ms
Free SCC test removed 16 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 3738 place count 378 transition count 1216
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 241 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 3979 place count 378 transition count 975
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 4009 place count 363 transition count 960
Applied a total of 4009 rules in 125 ms. Remains 363 /591 variables (removed 228) and now considering 960/4756 (removed 3796) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 960 rows 363 cols
[2025-06-05 22:30:45] [INFO ] Computed 49 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:30:45] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-05 22:30:45] [INFO ] [Real]Absence check using 18 positive and 31 generalized place invariants in 43 ms returned sat
[2025-06-05 22:30:46] [INFO ] After 820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:30:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-05 22:30:46] [INFO ] [Nat]Absence check using 18 positive and 31 generalized place invariants in 13 ms returned sat
[2025-06-05 22:30:46] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2025-06-05 22:30:46] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 22:30:47] [INFO ] After 370ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2025-06-05 22:30:47] [INFO ] After 827ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-06-05 22:30:47] [INFO ] After 1817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2025-06-05 22:30:48] [INFO ] Flatten gal took : 108 ms
[2025-06-05 22:30:48] [INFO ] Flatten gal took : 79 ms
[2025-06-05 22:30:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7206979015292516545.gal : 5 ms
[2025-06-05 22:30:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15694458756924182964.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7206979015292516545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15694458756924182964.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15694458756924182964.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :12 after 21
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :21 after 41
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :41 after 83
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :83 after 200
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :200 after 507
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :507 after 1365
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1365 after 4308
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :4308 after 12811
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :12811 after 34949
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :34949 after 127125
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :119039 after 133793
Detected timeout of ITS tools.
[2025-06-05 22:31:03] [INFO ] Flatten gal took : 26 ms
[2025-06-05 22:31:03] [INFO ] Applying decomposition
[2025-06-05 22:31:03] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3857049372646421247.txt' '-o' '/tmp/graph3857049372646421247.bin' '-w' '/tmp/graph3857049372646421247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3857049372646421247.bin' '-l' '-1' '-v' '-w' '/tmp/graph3857049372646421247.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:31:03] [INFO ] Decomposing Gal with order
[2025-06-05 22:31:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:31:03] [INFO ] Removed a total of 1888 redundant transitions.
[2025-06-05 22:31:03] [INFO ] Flatten gal took : 136 ms
[2025-06-05 22:31:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 510 labels/synchronizations in 53 ms.
[2025-06-05 22:31:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9530250721007062052.gal : 8 ms
[2025-06-05 22:31:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16821220862199729234.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9530250721007062052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16821220862199729234.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16821220862199729234.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :16 after 18
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :31 after 37
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :37 after 61
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :61 after 204
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :204 after 865
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :865 after 1242
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1242 after 6593
Detected timeout of ITS tools.
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :6593 after 18879
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :18879 after 47610
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :47610 after 70576
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 33741 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12, 14, 14] Max Struct:[15, 15, 15]
Starting property specific reduction for SafeBus-COL-15-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:[15]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[15]
[2025-06-05 22:31:18] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2025-06-05 22:31:18] [INFO ] Computed 50 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[15]
RANDOM walk for 10000 steps (2 resets) in 117 ms. (84 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[15]
[2025-06-05 22:31:18] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:31:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:31:19] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2025-06-05 22:31:19] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2025-06-05 22:31:19] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2025-06-05 22:31:19] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:31:19] [INFO ] [Real]Added 241 Read/Feed constraints in 160 ms returned sat
[2025-06-05 22:31:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:31:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:31:19] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2025-06-05 22:31:20] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2025-06-05 22:31:20] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 22:31:21] [INFO ] [Nat]Added 241 Read/Feed constraints in 986 ms returned sat
[2025-06-05 22:31:21] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 128 ms.
[2025-06-05 22:31:21] [INFO ] Added : 0 causal constraints over 0 iterations in 253 ms. Result :sat
Minimization took 563 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[15]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4741
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4741
Applied a total of 30 rules in 1036 ms. Remains 576 /591 variables (removed 15) and now considering 4741/4756 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1037 ms. Remains : 576/591 places, 4741/4756 transitions.
[2025-06-05 22:31:22] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2025-06-05 22:31:22] [INFO ] Computed 50 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 12823 ms. (77 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 2384 ms. (419 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[15]
[2025-06-05 22:31:38] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:31:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:31:38] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2025-06-05 22:31:38] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 8 ms returned sat
[2025-06-05 22:31:38] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2025-06-05 22:31:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:31:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2025-06-05 22:31:38] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 9 ms returned sat
[2025-06-05 22:31:39] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2025-06-05 22:31:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:31:40] [INFO ] [Nat]Added 241 Read/Feed constraints in 1675 ms returned sat
[2025-06-05 22:31:41] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 130 ms.
[2025-06-05 22:31:41] [INFO ] Added : 1 causal constraints over 1 iterations in 343 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 970 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 970 ms. Remains : 576/576 places, 4741/4741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 962 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2025-06-05 22:31:47] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:31:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:31:48] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2025-06-05 22:31:48] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:31:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:31:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:31:55] [INFO ] Implicit Places using invariants and state equation in 6796 ms returned []
Implicit Place search using SMT with State Equation took 7951 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:31:55] [INFO ] Redundant transitions in 211 ms returned []
Running 4726 sub problems to find dead transitions.
[2025-06-05 22:31:55] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:31:55] [INFO ] Invariant cache hit.
[2025-06-05 22:31:55] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4726 unsolved
SMT process timed out in 37354ms, After SMT, problems are : Problem set: 0 solved, 4726 unsolved
Search for dead transitions found 0 dead transitions in 37365ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46508 ms. Remains : 576/576 places, 4741/4741 transitions.
[2025-06-05 22:32:33] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:32:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 12708 ms. (78 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2347 ms. (425 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[15]
[2025-06-05 22:32:48] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:32:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:32:48] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-06-05 22:32:48] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 11 ms returned sat
[2025-06-05 22:32:48] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-06-05 22:32:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:32:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-06-05 22:32:48] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 9 ms returned sat
[2025-06-05 22:32:49] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2025-06-05 22:32:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:32:50] [INFO ] [Nat]Added 241 Read/Feed constraints in 1330 ms returned sat
[2025-06-05 22:32:50] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 131 ms.
[2025-06-05 22:32:50] [INFO ] Added : 0 causal constraints over 0 iterations in 293 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 951 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 951 ms. Remains : 576/576 places, 4741/4741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 948 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2025-06-05 22:32:57] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:32:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:32:58] [INFO ] Implicit Places using invariants in 1216 ms returned []
[2025-06-05 22:32:58] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:32:58] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:33:05] [INFO ] Implicit Places using invariants and state equation in 6945 ms returned []
Implicit Place search using SMT with State Equation took 8163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:33:05] [INFO ] Redundant transitions in 216 ms returned []
Running 4726 sub problems to find dead transitions.
[2025-06-05 22:33:05] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:33:05] [INFO ] Invariant cache hit.
[2025-06-05 22:33:05] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4726 unsolved
SMT process timed out in 37141ms, After SMT, problems are : Problem set: 0 solved, 4726 unsolved
Search for dead transitions found 0 dead transitions in 37150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46493 ms. Remains : 576/576 places, 4741/4741 transitions.
[2025-06-05 22:33:42] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:33:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 12689 ms. (78 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2337 ms. (427 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[15]
[2025-06-05 22:33:57] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:33:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:33:57] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-06-05 22:33:57] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 10 ms returned sat
[2025-06-05 22:33:58] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-05 22:33:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:33:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-06-05 22:33:58] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 10 ms returned sat
[2025-06-05 22:33:58] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2025-06-05 22:33:58] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:34:00] [INFO ] [Nat]Added 241 Read/Feed constraints in 1334 ms returned sat
[2025-06-05 22:34:00] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 133 ms.
[2025-06-05 22:34:00] [INFO ] Added : 0 causal constraints over 0 iterations in 293 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 956 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 956 ms. Remains : 576/576 places, 4741/4741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 942 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2025-06-05 22:34:06] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:34:08] [INFO ] Implicit Places using invariants in 1208 ms returned []
[2025-06-05 22:34:08] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:34:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:34:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:34:14] [INFO ] Implicit Places using invariants and state equation in 6897 ms returned []
Implicit Place search using SMT with State Equation took 8107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:34:15] [INFO ] Redundant transitions in 209 ms returned []
Running 4726 sub problems to find dead transitions.
[2025-06-05 22:34:15] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:34:15] [INFO ] Invariant cache hit.
[2025-06-05 22:34:15] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4726 unsolved
SMT process timed out in 37177ms, After SMT, problems are : Problem set: 0 solved, 4726 unsolved
Search for dead transitions found 0 dead transitions in 37186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46460 ms. Remains : 576/576 places, 4741/4741 transitions.
[2025-06-05 22:34:52] [INFO ] Flatten gal took : 229 ms
RANDOM walk for 40000 steps (8 resets) in 1139 ms. (35 steps per ms) remains 2/2 properties
[2025-06-05 22:34:52] [INFO ] Flatten gal took : 201 ms
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
[2025-06-05 22:34:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2814124584571710160.gal : 24 ms
[2025-06-05 22:34:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10700746221985416900.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2814124584571710160.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10700746221985416900.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10700746221985416900.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 16
Interrupted probabilistic random walk after 132849 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 132849 steps, saw 84972 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2025-06-05 22:34:55] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
SDD proceeding with computation,2 properties remain. new max is 32
[2025-06-05 22:34:55] [INFO ] Invariant cache hit.
SDD size :16 after 42
[2025-06-05 22:34:55] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 513/528 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 130
[2025-06-05 22:34:56] [INFO ] Deduced a trap composed of 46 places in 412 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:34:56] [INFO ] Deduced a trap composed of 46 places in 386 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :130 after 201
[2025-06-05 22:34:57] [INFO ] Deduced a trap composed of 46 places in 470 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:34:57] [INFO ] Deduced a trap composed of 46 places in 393 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:34:58] [INFO ] Deduced a trap composed of 46 places in 382 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:34:58] [INFO ] Deduced a trap composed of 46 places in 410 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :201 after 826
[2025-06-05 22:34:59] [INFO ] Deduced a trap composed of 46 places in 446 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:34:59] [INFO ] Deduced a trap composed of 46 places in 415 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:34:59] [INFO ] Deduced a trap composed of 46 places in 370 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:00] [INFO ] Deduced a trap composed of 46 places in 374 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:00] [INFO ] Deduced a trap composed of 46 places in 403 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:01] [INFO ] Deduced a trap composed of 287 places in 366 ms of which 71 ms to minimize.
SMT process timed out in 5082ms, 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 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :826 after 1625
Applied a total of 0 rules in 950 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 952 ms. Remains : 576/576 places, 4741/4741 transitions.
RANDOM walk for 40000 steps (8 resets) in 920 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 138599 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 138599 steps, saw 88541 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2025-06-05 22:35:05] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:35:05] [INFO ] Invariant cache hit.
[2025-06-05 22:35:05] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 513/528 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:06] [INFO ] Deduced a trap composed of 46 places in 493 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:06] [INFO ] Deduced a trap composed of 46 places in 442 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:06] [INFO ] Deduced a trap composed of 46 places in 392 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:07] [INFO ] Deduced a trap composed of 46 places in 546 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:08] [INFO ] Deduced a trap composed of 46 places in 607 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:08] [INFO ] Deduced a trap composed of 46 places in 370 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:08] [INFO ] Deduced a trap composed of 46 places in 362 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1625 after 7272
[2025-06-05 22:35:09] [INFO ] Deduced a trap composed of 46 places in 379 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:09] [INFO ] Deduced a trap composed of 46 places in 387 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:10] [INFO ] Deduced a trap composed of 46 places in 379 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:10] [INFO ] Deduced a trap composed of 46 places in 374 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:10] [INFO ] Deduced a trap composed of 287 places in 372 ms of which 71 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 12/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/529 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/573 variables, 30/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1396/1970 variables, 574/635 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1970 variables, 240/875 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 0/875 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1973 variables, 2/877 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1973 variables, 1/878 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1973 variables, 1/879 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 0/879 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1973 variables, 0/879 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 879 constraints, problems are : Problem set: 1 solved, 1 unsolved in 6192 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 513/528 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 12/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/529 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/573 variables, 30/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1396/1970 variables, 574/635 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1970 variables, 240/875 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 1/876 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 0/876 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1973 variables, 2/878 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1973 variables, 1/879 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 1/880 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1973 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 880 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2608 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8842ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 463 ms.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 951 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 951 ms. Remains : 576/576 places, 4741/4741 transitions.
RANDOM walk for 40000 steps (8 resets) in 881 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 158630 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 1
Probabilistic random walk after 158630 steps, saw 100794 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2025-06-05 22:35:19] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:35:19] [INFO ] Invariant cache hit.
[2025-06-05 22:35:19] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 513/528 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/529 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/573 variables, 30/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/574 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7272 after 34552
At refinement iteration 9 (OVERLAPS) 1396/1970 variables, 574/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1970 variables, 240/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1970 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/1973 variables, 2/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1973 variables, 1/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1973 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1973 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1973 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 867 constraints, problems are : Problem set: 0 solved, 1 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 513/528 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:20] [INFO ] Deduced a trap composed of 46 places in 373 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:35:20] [INFO ] Deduced a trap composed of 61 places in 384 ms of which 49 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/529 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/573 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1396/1970 variables, 574/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1970 variables, 240/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 1/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1973 variables, 2/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1973 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1973 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2327 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3362ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 516 ms.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 946 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 946 ms. Remains : 576/576 places, 4741/4741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 930 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2025-06-05 22:35:24] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:35:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:35:25] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2025-06-05 22:35:25] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:35:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:35:26] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:35:32] [INFO ] Implicit Places using invariants and state equation in 6956 ms returned []
Implicit Place search using SMT with State Equation took 8165 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:35:33] [INFO ] Redundant transitions in 202 ms returned []
Running 4726 sub problems to find dead transitions.
[2025-06-05 22:35:33] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2025-06-05 22:35:33] [INFO ] Invariant cache hit.
[2025-06-05 22:35:33] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :34552 after 62466
Detected timeout of ITS tools.
[2025-06-05 22:35:43] [INFO ] Flatten gal took : 164 ms
[2025-06-05 22:35:43] [INFO ] Applying decomposition
[2025-06-05 22:35:43] [INFO ] Flatten gal took : 169 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4061672859451248511.txt' '-o' '/tmp/graph4061672859451248511.bin' '-w' '/tmp/graph4061672859451248511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4061672859451248511.bin' '-l' '-1' '-v' '-w' '/tmp/graph4061672859451248511.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:35:43] [INFO ] Decomposing Gal with order
[2025-06-05 22:35:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:35:44] [INFO ] Removed a total of 748 redundant transitions.
[2025-06-05 22:35:44] [INFO ] Flatten gal took : 335 ms
[2025-06-05 22:35:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 1043 labels/synchronizations in 19 ms.
[2025-06-05 22:35:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14802067314712543307.gal : 23 ms
[2025-06-05 22:35:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15367485890982233794.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14802067314712543307.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15367485890982233794.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15367485890982233794.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 289
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :289 after 432
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :432 after 442
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :442 after 455
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :455 after 472
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :472 after 494
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :494 after 2479
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4726 unsolved
SMT process timed out in 37268ms, After SMT, problems are : Problem set: 0 solved, 4726 unsolved
Search for dead transitions found 0 dead transitions in 37278ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46598 ms. Remains : 576/576 places, 4741/4741 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3344 transitions
Reduce isomorphic transitions removed 3344 transitions.
Iterating post reduction 0 with 3344 rules applied. Total rules applied 3344 place count 576 transition count 1397
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 3539 place count 381 transition count 1202
Iterating global reduction 1 with 195 rules applied. Total rules applied 3734 place count 381 transition count 1202
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 3737 place count 379 transition count 1201
Graph (trivial) has 46 edges and 379 vertex of which 17 / 379 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 3738 place count 363 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 241 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 3979 place count 363 transition count 960
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 4009 place count 348 transition count 945
Applied a total of 4009 rules in 48 ms. Remains 348 /576 variables (removed 228) and now considering 945/4741 (removed 3796) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 945 rows 348 cols
[2025-06-05 22:36:10] [INFO ] Computed 49 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:36:10] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-05 22:36:10] [INFO ] [Real]Absence check using 17 positive and 32 generalized place invariants in 27 ms returned sat
[2025-06-05 22:36:10] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:36:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-05 22:36:10] [INFO ] [Nat]Absence check using 17 positive and 32 generalized place invariants in 12 ms returned sat
[2025-06-05 22:36:10] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-05 22:36:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 22:36:11] [INFO ] After 158ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 22:36:11] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 22:36:11] [INFO ] After 766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-05 22:36:11] [INFO ] Flatten gal took : 29 ms
[2025-06-05 22:36:11] [INFO ] Flatten gal took : 26 ms
[2025-06-05 22:36:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3254187670046476989.gal : 4 ms
[2025-06-05 22:36:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11943376016838134948.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3254187670046476989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11943376016838134948.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11943376016838134948.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 98
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :98 after 352
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :352 after 661
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :661 after 2262
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2262 after 7808
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7808 after 17278
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :17278 after 76399
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76399 after 167512
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :167512 after 572340
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2479 after 11649
Detected timeout of ITS tools.
[2025-06-05 22:36:26] [INFO ] Flatten gal took : 26 ms
[2025-06-05 22:36:26] [INFO ] Applying decomposition
[2025-06-05 22:36:26] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph17320076668880892271.txt' '-o' '/tmp/graph17320076668880892271.bin' '-w' '/tmp/graph17320076668880892271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17320076668880892271.bin' '-l' '-1' '-v' '-w' '/tmp/graph17320076668880892271.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:36:26] [INFO ] Decomposing Gal with order
[2025-06-05 22:36:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:36:26] [INFO ] Removed a total of 1520 redundant transitions.
[2025-06-05 22:36:26] [INFO ] Flatten gal took : 91 ms
[2025-06-05 22:36:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 457 labels/synchronizations in 17 ms.
[2025-06-05 22:36:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8647077748149470577.gal : 6 ms
[2025-06-05 22:36:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15049694294235509786.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8647077748149470577.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15049694294235509786.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15049694294235509786.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 19
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :19 after 25
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :25 after 29
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :29 after 51
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :51 after 117
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :117 after 219
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :219 after 353
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :353 after 963
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :963 after 2141
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2141 after 6148
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6148 after 31701
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31484 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12] Max Struct:[15]
Ending property specific reduction for SafeBus-COL-15-UpperBounds-01 in 323100 ms.
Starting property specific reduction for SafeBus-COL-15-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:[15]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[15]
[2025-06-05 22:36:41] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2025-06-05 22:36:41] [INFO ] Computed 50 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[15]
RANDOM walk for 10000 steps (2 resets) in 119 ms. (83 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14] Max Struct:[15]
[2025-06-05 22:36:42] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:36:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:36:42] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:36:42] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2025-06-05 22:36:42] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2025-06-05 22:36:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:36:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-05 22:36:42] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2025-06-05 22:36:43] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2025-06-05 22:36:43] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:36:43] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 22:36:44] [INFO ] [Nat]Added 241 Read/Feed constraints in 1059 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[14] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14] Max Struct:[15]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 948 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 949 ms. Remains : 591/591 places, 4756/4756 transitions.
[2025-06-05 22:36:45] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:36:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 11721 ms. (85 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2042 ms. (489 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14] Max Struct:[15]
[2025-06-05 22:36:59] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:36:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:36:59] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:36:59] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned sat
[2025-06-05 22:36:59] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2025-06-05 22:36:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:36:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2025-06-05 22:36:59] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned sat
[2025-06-05 22:37:00] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2025-06-05 22:37:00] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:37:02] [INFO ] [Nat]Added 241 Read/Feed constraints in 1989 ms returned sat
[2025-06-05 22:37:02] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 130 ms.
[2025-06-05 22:37:02] [INFO ] Added : 0 causal constraints over 0 iterations in 300 ms. Result :sat
Minimization took 6172 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14] Max Struct:[15]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 935 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 935 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 947 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2025-06-05 22:37:10] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:37:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:37:12] [INFO ] Implicit Places using invariants in 1249 ms returned []
[2025-06-05 22:37:12] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:37:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:37:12] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:37:19] [INFO ] Implicit Places using invariants and state equation in 7338 ms returned []
Implicit Place search using SMT with State Equation took 8589 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:37:19] [INFO ] Redundant transitions in 213 ms returned []
Running 4741 sub problems to find dead transitions.
[2025-06-05 22:37:19] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:37:19] [INFO ] Invariant cache hit.
[2025-06-05 22:37:19] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 37266ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 37276ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47039 ms. Remains : 591/591 places, 4756/4756 transitions.
[2025-06-05 22:37:57] [INFO ] Flatten gal took : 228 ms
RANDOM walk for 40000 steps (8 resets) in 847 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
[2025-06-05 22:37:57] [INFO ] Flatten gal took : 161 ms
[2025-06-05 22:37:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16064416307390102185.gal : 22 ms
[2025-06-05 22:37:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16256539461886676360.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16064416307390102185.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16256539461886676360.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16256539461886676360.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
Interrupted probabilistic random walk after 156232 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 2
Probabilistic random walk after 156232 steps, saw 90398 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2025-06-05 22:38:00] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:38:00] [INFO ] Invariant cache hit.
[2025-06-05 22:38:00] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 514/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 34
[2025-06-05 22:38:00] [INFO ] Deduced a trap composed of 46 places in 449 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:01] [INFO ] Deduced a trap composed of 61 places in 464 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 57
[2025-06-05 22:38:01] [INFO ] Deduced a trap composed of 61 places in 411 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:02] [INFO ] Deduced a trap composed of 61 places in 414 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:02] [INFO ] Deduced a trap composed of 61 places in 452 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :57 after 158
[2025-06-05 22:38:03] [INFO ] Deduced a trap composed of 61 places in 418 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:03] [INFO ] Deduced a trap composed of 61 places in 421 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:04] [INFO ] Deduced a trap composed of 61 places in 416 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:04] [INFO ] Deduced a trap composed of 61 places in 423 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:04] [INFO ] Deduced a trap composed of 61 places in 423 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:05] [INFO ] Deduced a trap composed of 61 places in 422 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5024ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 945 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 945 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 894 ms. (44 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :158 after 320
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 150584 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 150584 steps, saw 87224 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2025-06-05 22:38:09] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:38:09] [INFO ] Invariant cache hit.
[2025-06-05 22:38:09] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 514/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:10] [INFO ] Deduced a trap composed of 46 places in 470 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:10] [INFO ] Deduced a trap composed of 61 places in 460 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:11] [INFO ] Deduced a trap composed of 61 places in 500 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:11] [INFO ] Deduced a trap composed of 61 places in 473 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:12] [INFO ] Deduced a trap composed of 61 places in 400 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:12] [INFO ] Deduced a trap composed of 61 places in 422 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:13] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:13] [INFO ] Deduced a trap composed of 61 places in 415 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :320 after 1103
[2025-06-05 22:38:14] [INFO ] Deduced a trap composed of 61 places in 446 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:14] [INFO ] Deduced a trap composed of 61 places in 462 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:15] [INFO ] Deduced a trap composed of 61 places in 482 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 58/588 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:15] [INFO ] Deduced a trap composed of 31 places in 689 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:16] [INFO ] Deduced a trap composed of 31 places in 662 ms of which 48 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/589 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1411/2000 variables, 589/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 240/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/2003 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2003 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/2003 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 895 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8051 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 514/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/588 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/589 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1411/2000 variables, 589/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 240/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/2003 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2003 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2003 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 895 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2874 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10960ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 164 ms.
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 928 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 928 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 948 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2025-06-05 22:38:22] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:38:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:38:24] [INFO ] Implicit Places using invariants in 1321 ms returned []
[2025-06-05 22:38:24] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:38:24] [INFO ] State equation strengthened by 241 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1103 after 5316
[2025-06-05 22:38:31] [INFO ] Implicit Places using invariants and state equation in 7468 ms returned []
Implicit Place search using SMT with State Equation took 8802 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:38:31] [INFO ] Redundant transitions in 203 ms returned []
Running 4741 sub problems to find dead transitions.
[2025-06-05 22:38:31] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:38:31] [INFO ] Invariant cache hit.
[2025-06-05 22:38:31] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
[2025-06-05 22:38:47] [INFO ] Flatten gal took : 160 ms
[2025-06-05 22:38:47] [INFO ] Applying decomposition
[2025-06-05 22:38:47] [INFO ] Flatten gal took : 161 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10252555357214016550.txt' '-o' '/tmp/graph10252555357214016550.bin' '-w' '/tmp/graph10252555357214016550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10252555357214016550.bin' '-l' '-1' '-v' '-w' '/tmp/graph10252555357214016550.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:38:48] [INFO ] Decomposing Gal with order
[2025-06-05 22:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:38:55] [INFO ] Removed a total of 3852 redundant transitions.
[2025-06-05 22:38:55] [INFO ] Flatten gal took : 7041 ms
[2025-06-05 22:38:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 7273 labels/synchronizations in 327 ms.
[2025-06-05 22:38:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4284398680139575612.gal : 20 ms
[2025-06-05 22:38:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12366352510297252233.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4284398680139575612.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12366352510297252233.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12366352510297252233.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 74
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :74 after 145
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 37438ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 37448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47420 ms. Remains : 591/591 places, 4756/4756 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3344 transitions
Reduce isomorphic transitions removed 3344 transitions.
Iterating post reduction 0 with 3344 rules applied. Total rules applied 3344 place count 591 transition count 1412
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 3554 place count 381 transition count 992
Iterating global reduction 1 with 210 rules applied. Total rules applied 3764 place count 381 transition count 992
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 3767 place count 379 transition count 991
Graph (trivial) has 46 edges and 379 vertex of which 17 / 379 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 3768 place count 363 transition count 991
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 241 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 4009 place count 363 transition count 750
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 4039 place count 348 transition count 735
Applied a total of 4039 rules in 67 ms. Remains 348 /591 variables (removed 243) and now considering 735/4756 (removed 4021) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 735 rows 348 cols
[2025-06-05 22:39:09] [INFO ] Computed 49 invariants in 6 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:39:09] [INFO ] [Real]Absence check using 18 positive place invariants in 145 ms returned sat
[2025-06-05 22:39:09] [INFO ] [Real]Absence check using 18 positive and 31 generalized place invariants in 81 ms returned sat
[2025-06-05 22:39:10] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:39:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-05 22:39:10] [INFO ] [Nat]Absence check using 18 positive and 31 generalized place invariants in 11 ms returned sat
[2025-06-05 22:39:10] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-05 22:39:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 22:39:10] [INFO ] After 197ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-05 22:39:11] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-05 22:39:11] [INFO ] After 1024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-05 22:39:11] [INFO ] Flatten gal took : 20 ms
[2025-06-05 22:39:11] [INFO ] Flatten gal took : 19 ms
[2025-06-05 22:39:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8107963202896206293.gal : 4 ms
[2025-06-05 22:39:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14703393703380072331.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8107963202896206293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14703393703380072331.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14703393703380072331.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 55
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :55 after 119
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :119 after 199
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :199 after 485
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :485 after 1057
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1057 after 2299
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2299 after 5340
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5340 after 17538
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :17538 after 31637
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :31637 after 106570
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :145 after 32668
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :32668 after 51832
Detected timeout of ITS tools.
[2025-06-05 22:39:26] [INFO ] Flatten gal took : 21 ms
[2025-06-05 22:39:26] [INFO ] Applying decomposition
[2025-06-05 22:39:26] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph5799614307606699534.txt' '-o' '/tmp/graph5799614307606699534.bin' '-w' '/tmp/graph5799614307606699534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5799614307606699534.bin' '-l' '-1' '-v' '-w' '/tmp/graph5799614307606699534.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:39:26] [INFO ] Decomposing Gal with order
[2025-06-05 22:39:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:39:26] [INFO ] Removed a total of 1236 redundant transitions.
[2025-06-05 22:39:26] [INFO ] Flatten gal took : 58 ms
[2025-06-05 22:39:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 10 ms.
[2025-06-05 22:39:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7357674307436793383.gal : 4 ms
[2025-06-05 22:39:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13177506473044860822.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7357674307436793383.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13177506473044860822.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13177506473044860822.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 44
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :44 after 114
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :114 after 213
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :213 after 520
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :520 after 879
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :879 after 3924
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3924 after 9959
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9959 after 29827
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :29827 after 80491
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :51832 after 114172
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32300 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[14] Max Struct:[15]
Ending property specific reduction for SafeBus-COL-15-UpperBounds-08 in 179732 ms.
Starting property specific reduction for SafeBus-COL-15-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:[15]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[15]
[2025-06-05 22:39:41] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2025-06-05 22:39:41] [INFO ] Computed 50 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[15]
RANDOM walk for 10000 steps (2 resets) in 156 ms. (63 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 33 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14] Max Struct:[15]
[2025-06-05 22:39:41] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:39:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:39:41] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:39:41] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2025-06-05 22:39:42] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-05 22:39:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 22:39:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:39:42] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2025-06-05 22:39:43] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2025-06-05 22:39:43] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:39:43] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-05 22:39:44] [INFO ] [Nat]Added 241 Read/Feed constraints in 1054 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[14] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14] Max Struct:[15]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 955 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 955 ms. Remains : 591/591 places, 4756/4756 transitions.
[2025-06-05 22:39:45] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:39:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 11830 ms. (84 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 3317 ms. (301 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14] Max Struct:[15]
[2025-06-05 22:40:00] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:40:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:40:00] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:40:00] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2025-06-05 22:40:00] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2025-06-05 22:40:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 22:40:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-05 22:40:00] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2025-06-05 22:40:01] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2025-06-05 22:40:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:40:05] [INFO ] [Nat]Added 241 Read/Feed constraints in 3953 ms returned sat
[2025-06-05 22:40:05] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 134 ms.
[2025-06-05 22:40:05] [INFO ] Added : 1 causal constraints over 1 iterations in 332 ms. Result :sat
Minimization took 6221 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14] Max Struct:[15]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 964 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 965 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 954 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2025-06-05 22:40:14] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:40:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:40:15] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2025-06-05 22:40:15] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:40:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:40:15] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 22:40:22] [INFO ] Implicit Places using invariants and state equation in 7076 ms returned []
Implicit Place search using SMT with State Equation took 8329 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:40:22] [INFO ] Redundant transitions in 210 ms returned []
Running 4741 sub problems to find dead transitions.
[2025-06-05 22:40:22] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:40:22] [INFO ] Invariant cache hit.
[2025-06-05 22:40:22] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 37435ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 37444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46952 ms. Remains : 591/591 places, 4756/4756 transitions.
[2025-06-05 22:41:00] [INFO ] Flatten gal took : 218 ms
RANDOM walk for 40000 steps (8 resets) in 1249 ms. (32 steps per ms) remains 2/2 properties
[2025-06-05 22:41:00] [INFO ] Flatten gal took : 172 ms
[2025-06-05 22:41:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10561455929319592485.gal : 23 ms
[2025-06-05 22:41:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16423874758599767694.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10561455929319592485.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16423874758599767694.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (8 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16423874758599767694.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
Interrupted probabilistic random walk after 145980 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 145980 steps, saw 84775 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2025-06-05 22:41:03] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:41:03] [INFO ] Invariant cache hit.
[2025-06-05 22:41:03] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 514/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 34
[2025-06-05 22:41:04] [INFO ] Deduced a trap composed of 46 places in 394 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:04] [INFO ] Deduced a trap composed of 61 places in 417 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 57
[2025-06-05 22:41:05] [INFO ] Deduced a trap composed of 61 places in 546 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:05] [INFO ] Deduced a trap composed of 61 places in 414 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:05] [INFO ] Deduced a trap composed of 61 places in 418 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :57 after 158
[2025-06-05 22:41:06] [INFO ] Deduced a trap composed of 61 places in 414 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:06] [INFO ] Deduced a trap composed of 61 places in 497 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:07] [INFO ] Deduced a trap composed of 61 places in 461 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:07] [INFO ] Deduced a trap composed of 61 places in 398 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:08] [INFO ] Deduced a trap composed of 61 places in 420 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:08] [INFO ] Deduced a trap composed of 61 places in 421 ms of which 50 ms to minimize.
SMT process timed out in 5073ms, 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 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 926 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 926 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 905 ms. (44 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :158 after 320
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 149780 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 149780 steps, saw 86752 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2025-06-05 22:41:13] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:41:13] [INFO ] Invariant cache hit.
[2025-06-05 22:41:13] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 514/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:13] [INFO ] Deduced a trap composed of 46 places in 391 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:13] [INFO ] Deduced a trap composed of 61 places in 411 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:14] [INFO ] Deduced a trap composed of 61 places in 412 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:14] [INFO ] Deduced a trap composed of 61 places in 416 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:15] [INFO ] Deduced a trap composed of 61 places in 408 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:15] [INFO ] Deduced a trap composed of 61 places in 425 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:16] [INFO ] Deduced a trap composed of 61 places in 433 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:16] [INFO ] Deduced a trap composed of 61 places in 445 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :320 after 1103
[2025-06-05 22:41:17] [INFO ] Deduced a trap composed of 61 places in 439 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:17] [INFO ] Deduced a trap composed of 61 places in 456 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:17] [INFO ] Deduced a trap composed of 61 places in 407 ms of which 49 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 58/588 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/589 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1411/2000 variables, 589/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2000 variables, 240/889 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/2003 variables, 2/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2003 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2003 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2003 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 893 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6700 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 514/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:20] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/530 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/588 variables, 31/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/589 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1411/2000 variables, 589/650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 240/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2000 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/2003 variables, 2/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2003 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2003 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3939 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10681ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 922 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 922 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 960 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2025-06-05 22:41:25] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:41:27] [INFO ] Implicit Places using invariants in 1278 ms returned []
[2025-06-05 22:41:27] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:41:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:41:27] [INFO ] State equation strengthened by 241 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1103 after 5316
[2025-06-05 22:41:34] [INFO ] Implicit Places using invariants and state equation in 7366 ms returned []
Implicit Place search using SMT with State Equation took 8666 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:41:34] [INFO ] Redundant transitions in 203 ms returned []
Running 4741 sub problems to find dead transitions.
[2025-06-05 22:41:34] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2025-06-05 22:41:34] [INFO ] Invariant cache hit.
[2025-06-05 22:41:34] [INFO ] State equation strengthened by 241 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
[2025-06-05 22:41:50] [INFO ] Flatten gal took : 157 ms
[2025-06-05 22:41:50] [INFO ] Applying decomposition
[2025-06-05 22:41:50] [INFO ] Flatten gal took : 162 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14997182394783876374.txt' '-o' '/tmp/graph14997182394783876374.bin' '-w' '/tmp/graph14997182394783876374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14997182394783876374.bin' '-l' '-1' '-v' '-w' '/tmp/graph14997182394783876374.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:41:51] [INFO ] Decomposing Gal with order
[2025-06-05 22:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:41:51] [INFO ] Removed a total of 631 redundant transitions.
[2025-06-05 22:41:51] [INFO ] Flatten gal took : 292 ms
[2025-06-05 22:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 734 labels/synchronizations in 10 ms.
[2025-06-05 22:41:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2004726522383749145.gal : 22 ms
[2025-06-05 22:41:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14426845098215347207.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2004726522383749145.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14426845098215347207.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14426845098215347207.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 16
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 136
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :136 after 201
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :201 after 849
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :849 after 1715
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 37535ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 37544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47388 ms. Remains : 591/591 places, 4756/4756 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3344 transitions
Reduce isomorphic transitions removed 3344 transitions.
Iterating post reduction 0 with 3344 rules applied. Total rules applied 3344 place count 591 transition count 1412
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 3554 place count 381 transition count 992
Iterating global reduction 1 with 210 rules applied. Total rules applied 3764 place count 381 transition count 992
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 3767 place count 379 transition count 991
Graph (trivial) has 46 edges and 379 vertex of which 17 / 379 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 3768 place count 363 transition count 991
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 241 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 4009 place count 363 transition count 750
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 4039 place count 348 transition count 735
Applied a total of 4039 rules in 42 ms. Remains 348 /591 variables (removed 243) and now considering 735/4756 (removed 4021) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 735 rows 348 cols
[2025-06-05 22:42:12] [INFO ] Computed 49 invariants in 7 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:42:12] [INFO ] [Real]Absence check using 18 positive place invariants in 97 ms returned sat
[2025-06-05 22:42:12] [INFO ] [Real]Absence check using 18 positive and 31 generalized place invariants in 11 ms returned sat
[2025-06-05 22:42:12] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:42:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2025-06-05 22:42:12] [INFO ] [Nat]Absence check using 18 positive and 31 generalized place invariants in 12 ms returned sat
[2025-06-05 22:42:13] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-05 22:42:13] [INFO ] State equation strengthened by 15 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 1024
[2025-06-05 22:42:13] [INFO ] After 81ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
SDD size :1715 after 7411
[2025-06-05 22:42:13] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-05 22:42:13] [INFO ] After 681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-05 22:42:13] [INFO ] Flatten gal took : 18 ms
[2025-06-05 22:42:13] [INFO ] Flatten gal took : 18 ms
[2025-06-05 22:42:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8086076448685374331.gal : 3 ms
[2025-06-05 22:42:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8561600334120021149.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8086076448685374331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8561600334120021149.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8561600334120021149.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 55
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :55 after 119
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :119 after 199
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :199 after 485
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :485 after 1057
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1057 after 2299
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2299 after 5340
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5340 after 17538
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :17538 after 31637
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :31637 after 106570
Detected timeout of ITS tools.
[2025-06-05 22:42:28] [INFO ] Flatten gal took : 17 ms
[2025-06-05 22:42:28] [INFO ] Applying decomposition
[2025-06-05 22:42:28] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1165555411866942517.txt' '-o' '/tmp/graph1165555411866942517.bin' '-w' '/tmp/graph1165555411866942517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1165555411866942517.bin' '-l' '-1' '-v' '-w' '/tmp/graph1165555411866942517.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:42:28] [INFO ] Decomposing Gal with order
[2025-06-05 22:42:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:42:28] [INFO ] Removed a total of 629 redundant transitions.
[2025-06-05 22:42:28] [INFO ] Flatten gal took : 67 ms
[2025-06-05 22:42:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 362 labels/synchronizations in 6 ms.
[2025-06-05 22:42:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10271272228241140779.gal : 4 ms
[2025-06-05 22:42:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3537581188585685099.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10271272228241140779.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3537581188585685099.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3537581188585685099.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 21
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :21 after 37
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :37 after 12524
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7411 after 26322
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :12524 after 64581
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :64581 after 273245
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :273245 after 274855
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :274855 after 280493
Detected timeout of ITS tools.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :280493 after 289146
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31704 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[14] Max Struct:[15]
Ending property specific reduction for SafeBus-COL-15-UpperBounds-12 in 182292 ms.
[2025-06-05 22:42:44] [INFO ] Flatten gal took : 154 ms
[2025-06-05 22:42:44] [INFO ] Applying decomposition
[2025-06-05 22:42:44] [INFO ] Flatten gal took : 158 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10815996838869668088.txt' '-o' '/tmp/graph10815996838869668088.bin' '-w' '/tmp/graph10815996838869668088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10815996838869668088.bin' '-l' '-1' '-v' '-w' '/tmp/graph10815996838869668088.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:42:44] [INFO ] Decomposing Gal with order
[2025-06-05 22:42:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:42:45] [INFO ] Removed a total of 11063 redundant transitions.
[2025-06-05 22:42:45] [INFO ] Flatten gal took : 615 ms
[2025-06-05 22:42:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1639 labels/synchronizations in 88 ms.
[2025-06-05 22:42:45] [INFO ] Time to serialize gal into /tmp/UpperBounds1942299964906594213.gal : 9 ms
[2025-06-05 22:42:45] [INFO ] Time to serialize properties into /tmp/UpperBounds13303907087547973952.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1942299964906594213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13303907087547973952.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds13303907087547973952.prop.
ITS-tools command line returned an error code 137
[2025-06-05 23:01:32] [INFO ] Applying decomposition
[2025-06-05 23:01:33] [INFO ] Flatten gal took : 809 ms
[2025-06-05 23:01:34] [INFO ] Decomposing Gal with order
[2025-06-05 23:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 23:01:34] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cable_free in partition [AMC_0],[AMC_1, wait_ack_1],[AMC_2, wait_ack_2],[AMC_3, wait_ack_3],[AMC_4, wait_ack_4],[AMC_5, wait_ack_5],[AMC_6, wait_ack_6],[AMC_7, wait_ack_7],[AMC_8, wait_ack_8],[AMC_9, wait_ack_9],[AMC_10, wait_ack_10],[AMC_11, wait_ack_11],[AMC_12, wait_ack_12],[AMC_13, wait_ack_13],[AMC_14, wait_ack_14],[AMC_15, wait_ack_15],[AMC_16],[AMC_17, wait_ack_17],[AMC_18, wait_ack_18],[AMC_19, wait_ack_19],[AMC_20, wait_ack_20],[AMC_21, wait_ack_21],[AMC_22, wait_ack_22],[AMC_23, wait_ack_23],[AMC_24, wait_ack_24],[AMC_25, wait_ack_25],[AMC_26, wait_ack_26],[AMC_27, wait_ack_27],[AMC_28, wait_ack_28],[AMC_29, wait_ack_29],[AMC_30, wait_ack_30],[AMC_31, wait_ack_31],[AMC_32],[AMC_33, wait_ack_33],[AMC_34, wait_ack_34],[AMC_35, wait_ack_35],[AMC_36, wait_ack_36],[AMC_37, wait_ack_37],[AMC_38, wait_ack_38],[AMC_39, wait_ack_39],[AMC_40, wait_ack_40],[AMC_41, wait_ack_41],[AMC_42, wait_ack_42],[AMC_43, wait_ack_43],[AMC_44, wait_ack_44],[AMC_45, wait_ack_45],[AMC_46, wait_ack_46],[AMC_47, wait_ack_47],[AMC_48],[AMC_49, wait_ack_49],[AMC_50, wait_ack_50],[AMC_51, wait_ack_51],[AMC_52, wait_ack_52],[AMC_53, wait_ack_53],[AMC_54, wait_ack_54],[AMC_55, wait_ack_55],[AMC_56, wait_ack_56],[AMC_57, wait_ack_57],[AMC_58, wait_ack_58],[AMC_59, wait_ack_59],[AMC_60, wait_ack_60],[AMC_61, wait_ack_61],[AMC_62, wait_ack_62],[AMC_63, wait_ack_63],[AMC_64],[AMC_65, wait_ack_65],[AMC_66, wait_ack_66],[AMC_67, wait_ack_67],[AMC_68, wait_ack_68],[AMC_69, wait_ack_69],[AMC_70, wait_ack_70],[AMC_71, wait_ack_71],[AMC_72, wait_ack_72],[AMC_73, wait_ack_73],[AMC_74, wait_ack_74],[AMC_75, wait_ack_75],[AMC_76, wait_ack_76],[AMC_77, wait_ack_77],[AMC_78, wait_ack_78],[AMC_79, wait_ack_79],[AMC_80],[AMC_81, wait_ack_81],[AMC_82, wait_ack_82],[AMC_83, wait_ack_83],[AMC_84, wait_ack_84],[AMC_85, wait_ack_85],[AMC_86, wait_ack_86],[AMC_87, wait_ack_87],[AMC_88, wait_ack_88],[AMC_89, wait_ack_89],[AMC_90, wait_ack_90],[AMC_91, wait_ack_91],[AMC_92, wait_ack_92],[AMC_93, wait_ack_93],[AMC_94, wait_ack_94],[AMC_95, wait_ack_95],[AMC_96],[AMC_97, wait_ack_97],[AMC_98, wait_ack_98],[AMC_99, wait_ack_99],[AMC_100, wait_ack_100],[AMC_101, wait_ack_101],[AMC_102, wait_ack_102],[AMC_103, wait_ack_103],[AMC_104, wait_ack_104],[AMC_105, wait_ack_105],[AMC_106, wait_ack_106],[AMC_107, wait_ack_107],[AMC_108, wait_ack_108],[AMC_109, wait_ack_109],[AMC_110, wait_ack_110],[AMC_111, wait_ack_111],[AMC_112],[AMC_113, wait_ack_113],[AMC_114, wait_ack_114],[AMC_115, wait_ack_115],[AMC_116, wait_ack_116],[AMC_117, wait_ack_117],[AMC_118, wait_ack_118],[AMC_119, wait_ack_119],[AMC_120, wait_ack_120],[AMC_121, wait_ack_121],[AMC_122, wait_ack_122],[AMC_123, wait_ack_123],[AMC_124, wait_ack_124],[AMC_125, wait_ack_125],[AMC_126, wait_ack_126],[AMC_127, wait_ack_127],[AMC_128],[AMC_129, wait_ack_129],[AMC_130, wait_ack_130],[AMC_131, wait_ack_131],[AMC_132, wait_ack_132],[AMC_133, wait_ack_133],[AMC_134, wait_ack_134],[AMC_135, wait_ack_135],[AMC_136, wait_ack_136],[AMC_137, wait_ack_137],[AMC_138, wait_ack_138],[AMC_139, wait_ack_139],[AMC_140, wait_ack_140],[AMC_141, wait_ack_141],[AMC_142, wait_ack_142],[AMC_143, wait_ack_143],[AMC_144],[AMC_145, wait_ack_145],[AMC_146, wait_ack_146],[AMC_147, wait_ack_147],[AMC_148, wait_ack_148],[AMC_149, wait_ack_149],[AMC_150, wait_ack_150],[AMC_151, wait_ack_151],[AMC_152, wait_ack_152],[AMC_153, wait_ack_153],[AMC_154, wait_ack_154],[AMC_155, wait_ack_155],[AMC_156, wait_ack_156],[AMC_157, wait_ack_157],[AMC_158, wait_ack_158],[AMC_159, wait_ack_159],[AMC_160],[AMC_161, wait_ack_161],[AMC_162, wait_ack_162],[AMC_163, wait_ack_163],[AMC_164, wait_ack_164],[AMC_165, wait_ack_165],[AMC_166, wait_ack_166],[AMC_167, wait_ack_167],[AMC_168, wait_ack_168],[AMC_169, wait_ack_169],[AMC_170, wait_ack_170],[AMC_171, wait_ack_171],[AMC_172, wait_ack_172],[AMC_173, wait_ack_173],[AMC_174, wait_ack_174],[AMC_175, wait_ack_175],[AMC_176],[AMC_177, wait_ack_177],[AMC_178, wait_ack_178],[AMC_179, wait_ack_179],[AMC_180, wait_ack_180],[AMC_181, wait_ack_181],[AMC_182, wait_ack_182],[AMC_183, wait_ack_183],[AMC_184, wait_ack_184],[AMC_185, wait_ack_185],[AMC_186, wait_ack_186],[AMC_187, wait_ack_187],[AMC_188, wait_ack_188],[AMC_189, wait_ack_189],[AMC_190, wait_ack_190],[AMC_191, wait_ack_191],[AMC_192],[AMC_193, wait_ack_193],[AMC_194, wait_ack_194],[AMC_195, wait_ack_195],[AMC_196, wait_ack_196],[AMC_197, wait_ack_197],[AMC_198, wait_ack_198],[AMC_199, wait_ack_199],[AMC_200, wait_ack_200],[AMC_201, wait_ack_201],[AMC_202, wait_ack_202],[AMC_203, wait_ack_203],[AMC_204, wait_ack_204],[AMC_205, wait_ack_205],[AMC_206, wait_ack_206],[AMC_207, wait_ack_207],[AMC_208],[AMC_209, wait_ack_209],[AMC_210, wait_ack_210],[AMC_211, wait_ack_211],[AMC_212, wait_ack_212],[AMC_213, wait_ack_213],[AMC_214, wait_ack_214],[AMC_215, wait_ack_215],[AMC_216, wait_ack_216],[AMC_217, wait_ack_217],[AMC_218, wait_ack_218],[AMC_219, wait_ack_219],[AMC_220, wait_ack_220],[AMC_221, wait_ack_221],[AMC_222, wait_ack_222],[AMC_223, wait_ack_223],[AMC_224],[Cpt2_0, Cpt1_0, cable_used_0, FMC_0, listen_0, RMC_0, PMC_0, MSG_0, wait_msg_0, loop_em_0],[Cpt2_1, Cpt1_1, cable_used_1, FMC_1, listen_1, RMC_1, PMC_1, MSG_1, wait_msg_1, loop_em_1],[Cpt2_2, Cpt1_2, cable_used_2, FMC_2, listen_2, RMC_2, PMC_2, MSG_2, wait_msg_2, loop_em_2],[Cpt2_3, Cpt1_3, cable_used_3, FMC_3, listen_3, RMC_3, PMC_3, MSG_3, wait_msg_3, loop_em_3],[Cpt2_4, Cpt1_4, cable_used_4, FMC_4, listen_4, RMC_4, PMC_4, MSG_4, wait_msg_4, loop_em_4],[Cpt2_5, Cpt1_5, cable_used_5, FMC_5, listen_5, RMC_5, PMC_5, MSG_5, wait_msg_5, loop_em_5],[Cpt2_6, Cpt1_6, cable_used_6, FMC_6, listen_6, RMC_6, PMC_6, MSG_6, wait_msg_6, loop_em_6],[Cpt2_7, Cpt1_7, cable_used_7, FMC_7, listen_7, RMC_7, PMC_7, MSG_7, wait_msg_7, loop_em_7],[Cpt2_8, Cpt1_8, cable_used_8, FMC_8, listen_8, RMC_8, PMC_8, MSG_8, wait_msg_8, loop_em_8],[Cpt2_9, Cpt1_9, cable_used_9, FMC_9, listen_9, RMC_9, PMC_9, MSG_9, wait_msg_9, loop_em_9],[Cpt2_10, Cpt1_10, cable_used_10, FMC_10, listen_10, RMC_10, PMC_10, MSG_10, wait_msg_10, loop_em_10],[Cpt2_11, Cpt1_11, cable_used_11, FMC_11, listen_11, RMC_11, PMC_11, MSG_11, wait_msg_11, loop_em_11],[Cpt2_12, Cpt1_12, cable_used_12, FMC_12, listen_12, RMC_12, PMC_12, MSG_12, wait_msg_12, loop_em_12],[Cpt2_13, Cpt1_13, cable_used_13, FMC_13, listen_13, RMC_13, PMC_13, MSG_13, wait_msg_13, loop_em_13],[Cpt2_14, Cpt1_14, cable_used_14, FMC_14, listen_14, RMC_14, PMC_14, MSG_14, wait_msg_14, loop_em_14],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-05 23:01:35] [INFO ] Flatten gal took : 723 ms
[2025-06-05 23:01:35] [INFO ] Time to serialize gal into /tmp/UpperBounds5222550965800584785.gal : 73 ms
[2025-06-05 23:01:35] [INFO ] Time to serialize properties into /tmp/UpperBounds3907259644251248961.prop : 4 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5222550965800584785.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3907259644251248961.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds3907259644251248961.prop.
ITS-tools command line returned an error code 137
[2025-06-05 23:17:07] [INFO ] Flatten gal took : 886 ms
[2025-06-05 23:17:11] [INFO ] Input system was already deterministic with 4756 transitions.
[2025-06-05 23:17:11] [INFO ] Transformed 591 places.
[2025-06-05 23:17:11] [INFO ] Transformed 4756 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-05 23:17:42] [INFO ] Time to serialize gal into /tmp/UpperBounds7273351917663837369.gal : 76 ms
[2025-06-05 23:17:42] [INFO ] Time to serialize properties into /tmp/UpperBounds4978237483586588087.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7273351917663837369.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4978237483586588087.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4978237483586588087.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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="SafeBus-COL-15"
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-5832"
echo " Executing tool itstools"
echo " Input is SafeBus-COL-15, 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 r184-tall-174889264700733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-15.tgz
mv SafeBus-COL-15 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 ;