About the Execution of ITS-Tools for PhilosophersDyn-COL-10
| 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 | ? ? 2 2 2 ? ? ? 2 ? 2 10 4 ? ? ? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253600205.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 PhilosophersDyn-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253600205
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 32K 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 PhilosophersDyn-COL-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748880139397
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-02 16:02:27] [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-02 16:02:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:02:27] [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-02 16:02:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 16:02:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 514 ms
[2025-06-02 16:02:27] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 8
[2025-06-02 16:02:27] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2025-06-02 16:02:27] [INFO ] Skeletonized 8 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 8 cols
[2025-06-02 16:02:27] [INFO ] Computed 3 invariants in 20 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 10, 0, 0] Max Struct:[10, 10, 10, 10, 10, 10, 10, +inf]
FORMULA PhilosophersDyn-COL-10-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 16:02:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:27] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:02:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 16:02:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 16:02:27] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:02:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 16:02:28] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:02:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:02:28] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 16:02:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-02 16:02:28] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:02:28] [INFO ] Added : 4 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2025-06-02 16:02:28] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:02:28] [INFO ] Added : 4 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 16:02:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 16:02:28] [INFO ] Added : 4 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Real]Added 4 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:02:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2025-06-02 16:02:28] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:02:28] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 16:02:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 16:02:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 16:02:28] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 16:02:28] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2025-06-02 16:02:28] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 70 ms.
[2025-06-02 16:02:28] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
[2025-06-02 16:02:28] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2025-06-02 16:02:28] [INFO ] Computed 39 invariants in 60 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
RANDOM walk for 10000 steps (1175 resets) in 219 ms. (45 steps per ms)
BEST_FIRST walk for 70007 steps (602 resets) in 134 ms. (518 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 2, 4, 2, 4, 2] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
[2025-06-02 16:02:29] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2025-06-02 16:02:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:29] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2025-06-02 16:02:29] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 16:02:29] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2025-06-02 16:02:29] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2025-06-02 16:02:29] [INFO ] [Real]Added 1030 Read/Feed constraints in 372 ms returned sat
[2025-06-02 16:02:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2025-06-02 16:02:30] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 16:02:30] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2025-06-02 16:02:30] [INFO ] [Nat]Added 1030 Read/Feed constraints in 369 ms returned sat
[2025-06-02 16:02:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 465 ms.
[2025-06-02 16:02:31] [INFO ] Added : 0 causal constraints over 0 iterations in 887 ms. Result :sat
Minimization took 1842 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:33] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned sat
[2025-06-02 16:02:33] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 16:02:33] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:02:34] [INFO ] [Real]Added 1030 Read/Feed constraints in 202 ms returned sat
[2025-06-02 16:02:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2025-06-02 16:02:34] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 16:02:34] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2025-06-02 16:02:34] [INFO ] [Nat]Added 1030 Read/Feed constraints in 211 ms returned sat
[2025-06-02 16:02:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 225 ms.
[2025-06-02 16:02:35] [INFO ] Added : 0 causal constraints over 0 iterations in 636 ms. Result :sat
Minimization took 608 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:36] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2025-06-02 16:02:36] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-02 16:02:36] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2025-06-02 16:02:36] [INFO ] [Real]Added 1030 Read/Feed constraints in 235 ms returned sat
[2025-06-02 16:02:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2025-06-02 16:02:36] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-02 16:02:37] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-06-02 16:02:37] [INFO ] [Nat]Added 1030 Read/Feed constraints in 429 ms returned sat
[2025-06-02 16:02:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 218 ms.
[2025-06-02 16:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 400 ms. Result :sat
Minimization took 582 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:38] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2025-06-02 16:02:38] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 16:02:38] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-06-02 16:02:39] [INFO ] [Real]Added 1030 Read/Feed constraints in 334 ms returned sat
[2025-06-02 16:02:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:39] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2025-06-02 16:02:39] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 16 ms returned sat
[2025-06-02 16:02:39] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2025-06-02 16:02:40] [INFO ] [Nat]Added 1030 Read/Feed constraints in 422 ms returned sat
[2025-06-02 16:02:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 211 ms.
[2025-06-02 16:02:40] [INFO ] Added : 0 causal constraints over 0 iterations in 686 ms. Result :sat
Minimization took 502 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:41] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned sat
[2025-06-02 16:02:41] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 16:02:41] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-06-02 16:02:42] [INFO ] [Real]Added 1030 Read/Feed constraints in 336 ms returned sat
[2025-06-02 16:02: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-02 16:02:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2025-06-02 16:02:42] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-02 16:02:42] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2025-06-02 16:02:42] [INFO ] [Nat]Added 1030 Read/Feed constraints in 336 ms returned sat
[2025-06-02 16:02:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 187 ms.
[2025-06-02 16:02:43] [INFO ] Added : 0 causal constraints over 0 iterations in 835 ms. Result :sat
Minimization took 599 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:44] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2025-06-02 16:02:44] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-02 16:02:44] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2025-06-02 16:02:45] [INFO ] [Real]Added 1030 Read/Feed constraints in 260 ms returned sat
[2025-06-02 16:02:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2025-06-02 16:02:45] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 16:02:45] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-06-02 16:02:45] [INFO ] [Nat]Added 1030 Read/Feed constraints in 321 ms returned sat
[2025-06-02 16:02:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 197 ms.
[2025-06-02 16:02:46] [INFO ] Added : 0 causal constraints over 0 iterations in 641 ms. Result :sat
Minimization took 575 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:47] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2025-06-02 16:02:47] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-02 16:02:47] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2025-06-02 16:02:47] [INFO ] [Real]Added 1030 Read/Feed constraints in 309 ms returned sat
[2025-06-02 16:02:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:02:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2025-06-02 16:02:47] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-02 16:02:48] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2025-06-02 16:02:48] [INFO ] [Nat]Added 1030 Read/Feed constraints in 323 ms returned sat
[2025-06-02 16:02:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 181 ms.
[2025-06-02 16:02:49] [INFO ] Added : 0 causal constraints over 0 iterations in 709 ms. Result :sat
Minimization took 581 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 2, 4, 2, 4, 2] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4, 2, 4, 2, 4, 2] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 196 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2025-06-02 16:02:50] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2025-06-02 16:02:50] [INFO ] Invariant cache hit.
[2025-06-02 16:02:50] [INFO ] State equation strengthened by 1030 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2041 is UNSAT
Problem TDEAD2042 is UNSAT
Problem TDEAD2043 is UNSAT
Problem TDEAD2044 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 190 solved, 2030 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1989 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2075 variables, and 39 constraints, problems are : Problem set: 380 solved, 1840 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 2040/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 380 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2075 variables, 1030/1239 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/2075 variables, and 2359 constraints, problems are : Problem set: 380 solved, 1840 unsolved in 21352 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 170/170 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 1840/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46593ms problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 46635ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 80 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46948 ms. Remains : 170/170 places, 1885/2265 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 1885 rows 170 cols
[2025-06-02 16:03:37] [INFO ] Computed 39 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4, 2, 4, 2, 4, 2] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
RANDOM walk for 1000000 steps (119505 resets) in 8100 ms. (123 steps per ms)
BEST_FIRST walk for 7000006 steps (61112 resets) in 7956 ms. (879 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 2, 4, 2, 4, 2] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
[2025-06-02 16:03:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:03:53] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:03:53] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2025-06-02 16:03:54] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2025-06-02 16:03:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:03:58] [INFO ] [Real]Added 1010 Read/Feed constraints in 4291 ms returned sat
[2025-06-02 16:03: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-02 16:03:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:03:58] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:03:58] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2025-06-02 16:04:00] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1633 ms returned sat
[2025-06-02 16:04:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 168 ms.
[2025-06-02 16:04:00] [INFO ] Added : 0 causal constraints over 0 iterations in 310 ms. Result :sat
Minimization took 4506 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:05] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:04:05] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:04:05] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-06-02 16:04:05] [INFO ] [Real]Added 1010 Read/Feed constraints in 230 ms returned sat
[2025-06-02 16:04:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:04:06] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2025-06-02 16:04:06] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-06-02 16:04:07] [INFO ] [Nat]Added 1010 Read/Feed constraints in 969 ms returned sat
[2025-06-02 16:04:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 169 ms.
[2025-06-02 16:04:07] [INFO ] Added : 0 causal constraints over 0 iterations in 306 ms. Result :sat
Minimization took 4503 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:12] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:04:12] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:04:12] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2025-06-02 16:04:13] [INFO ] [Real]Added 1010 Read/Feed constraints in 604 ms returned sat
[2025-06-02 16:04: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-02 16:04:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:04:13] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2025-06-02 16:04:13] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-06-02 16:04:15] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1472 ms returned sat
[2025-06-02 16:04:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 159 ms.
[2025-06-02 16:04:15] [INFO ] Added : 0 causal constraints over 0 iterations in 298 ms. Result :sat
Minimization took 4505 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:19] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:04:19] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 14 ms returned sat
[2025-06-02 16:04:20] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2025-06-02 16:04:20] [INFO ] [Real]Added 1010 Read/Feed constraints in 548 ms returned sat
[2025-06-02 16:04:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:04:20] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:04:21] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-06-02 16:04:22] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1374 ms returned sat
[2025-06-02 16:04:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 154 ms.
[2025-06-02 16:04:22] [INFO ] Added : 0 causal constraints over 0 iterations in 301 ms. Result :sat
Minimization took 4503 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:27] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:04:27] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:04:27] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2025-06-02 16:04:29] [INFO ] [Real]Added 1010 Read/Feed constraints in 1228 ms returned sat
[2025-06-02 16:04:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:04:29] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:04:29] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2025-06-02 16:04:30] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1177 ms returned sat
[2025-06-02 16:04:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 166 ms.
[2025-06-02 16:04:31] [INFO ] Added : 0 causal constraints over 0 iterations in 314 ms. Result :sat
Minimization took 4503 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:35] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:04:35] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:04:35] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2025-06-02 16:04:36] [INFO ] [Real]Added 1010 Read/Feed constraints in 303 ms returned sat
[2025-06-02 16:04:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:04:36] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:04:36] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2025-06-02 16:04:37] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1116 ms returned sat
[2025-06-02 16:04:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 155 ms.
[2025-06-02 16:04:38] [INFO ] Added : 0 causal constraints over 0 iterations in 309 ms. Result :sat
Minimization took 4505 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:42] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:04:42] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:04:42] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2025-06-02 16:04:43] [INFO ] [Real]Added 1010 Read/Feed constraints in 256 ms returned sat
[2025-06-02 16:04:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:04:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:04:43] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:04:43] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2025-06-02 16:04:45] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1757 ms returned sat
[2025-06-02 16:04:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 150 ms.
[2025-06-02 16:04:45] [INFO ] Added : 0 causal constraints over 0 iterations in 300 ms. Result :sat
Minimization took 4504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 2, 4, 2, 4, 2] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4, 2, 4, 2, 4, 2] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 79 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 79 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:04:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:04:50] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 16:04:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:04:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:04:58] [INFO ] Implicit Places using invariants and state equation in 7529 ms returned []
Implicit Place search using SMT with State Equation took 7655 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:04:58] [INFO ] Redundant transitions in 139 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:04:58] [INFO ] Invariant cache hit.
[2025-06-02 16:04:58] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33912ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33918ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41807 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2025-06-02 16:05:33] [INFO ] Flatten gal took : 328 ms
RANDOM walk for 40000 steps (4778 resets) in 1672 ms. (23 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (381 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (381 resets) in 251 ms. (158 steps per ms) remains 13/13 properties
[2025-06-02 16:05:33] [INFO ] Flatten gal took : 212 ms
BEST_FIRST walk for 40004 steps (282 resets) in 170 ms. (233 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (284 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (396 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
[2025-06-02 16:05:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17574557801630294966.gal : 84 ms
[2025-06-02 16:05:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10173076959379462091.prop : 3 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/ReachabilityCardinality17574557801630294966.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10173076959379462091.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 40003 steps (386 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (281 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (282 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (405 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (398 resets) in 145 ms. (274 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (360 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
Loading property file /tmp/ReachabilityCardinality10173076959379462091.prop.
BEST_FIRST walk for 40004 steps (360 resets) in 207 ms. (192 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (340 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :32 after 39
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :39 after 44
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :44 after 49
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :49 after 217
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :217 after 263
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :263 after 389
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :389 after 1305
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :1305 after 2791
Interrupted probabilistic random walk after 179727 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 13
Probabilistic random walk after 179727 steps, saw 46445 distinct states, run finished after 3006 ms. (steps per millisecond=59 ) properties seen :0
[2025-06-02 16:05:37] [INFO ] Invariant cache hit.
[2025-06-02 16:05:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
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/160 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:37] [INFO ] Deduced a trap composed of 48 places in 331 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:38] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:38] [INFO ] Deduced a trap composed of 56 places in 265 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :2791 after 7485
[2025-06-02 16:05:38] [INFO ] Deduced a trap composed of 56 places in 260 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:38] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:39] [INFO ] Deduced a trap composed of 56 places in 280 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:39] [INFO ] Deduced a trap composed of 54 places in 292 ms of which 29 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:39] [INFO ] Deduced a trap composed of 56 places in 291 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:40] [INFO ] Deduced a trap composed of 62 places in 262 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1885/2055 variables, 170/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :7485 after 13700
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 1010/1228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1228 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 13/8 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2055 variables, 170/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :13700 after 21482
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1228 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10103ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 89 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:05:47] [INFO ] Invariant cache hit.
[2025-06-02 16:05:47] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :21482 after 34433
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :34433 after 56797
Detected timeout of ITS tools.
[2025-06-02 16:06:23] [INFO ] Flatten gal took : 114 ms
[2025-06-02 16:06:23] [INFO ] Applying decomposition
[2025-06-02 16:06:24] [INFO ] Flatten gal took : 108 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/graph8427906399323919517.txt' '-o' '/tmp/graph8427906399323919517.bin' '-w' '/tmp/graph8427906399323919517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8427906399323919517.bin' '-l' '-1' '-v' '-w' '/tmp/graph8427906399323919517.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:06:24] [INFO ] Decomposing Gal with order
[2025-06-02 16:06:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:06:26] [INFO ] Removed a total of 3905 redundant transitions.
[2025-06-02 16:06:26] [INFO ] Flatten gal took : 1849 ms
[2025-06-02 16:06:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1530 labels/synchronizations in 166 ms.
[2025-06-02 16:06:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12949899134348662319.gal : 17 ms
[2025-06-02 16:06:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13663830390481763557.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/ReachabilityCardinality12949899134348662319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13663830390481763557.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/ReachabilityCardinality13663830390481763557.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :7 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :22 after 32
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :32 after 57
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :57 after 170
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :170 after 304
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :304 after 672
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :672 after 1840
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :1840 after 3565
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :3565 after 7624
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44127ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44228 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4797 resets) in 698 ms. (57 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (381 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (381 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (281 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (279 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (395 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (386 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (282 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (283 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (401 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (399 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (360 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (360 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (339 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 183188 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 13
Probabilistic random walk after 183188 steps, saw 47127 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
[2025-06-02 16:06:35] [INFO ] Invariant cache hit.
[2025-06-02 16:06:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
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/160 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:35] [INFO ] Deduced a trap composed of 48 places in 318 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:36] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:36] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:36] [INFO ] Deduced a trap composed of 56 places in 304 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:37] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:37] [INFO ] Deduced a trap composed of 56 places in 271 ms of which 23 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 8192
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :7624 after 14196
[2025-06-02 16:06:37] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 29 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:37] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:38] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1885/2055 variables, 170/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :14196 after 28004
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 1010/1228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Detected timeout of ITS tools.
At refinement iteration 10 (INCLUDED_ONLY) 0/2055 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1228 constraints, problems are : Problem set: 0 solved, 13 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 13/8 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2055 variables, 170/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 1010/1228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 8/1236 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1236 constraints, problems are : Problem set: 0 solved, 13 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 13/8 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90073ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 89 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:08:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:08:05] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-02 16:08:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:08:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:08:12] [INFO ] Implicit Places using invariants and state equation in 7510 ms returned []
Implicit Place search using SMT with State Equation took 7624 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:08:13] [INFO ] Redundant transitions in 120 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:08:13] [INFO ] Invariant cache hit.
[2025-06-02 16:08:13] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33961ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33966ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41794 ms. Remains : 170/170 places, 1885/1885 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4, 4, 2, 4, 2, 4, 2] Max Struct:[10, 10, 10, 10, 10, 10, +inf]
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2025-06-02 16:08:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1184 resets) in 62 ms. (158 steps per ms)
BEST_FIRST walk for 10001 steps (96 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:08:47] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:08:47] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:08:47] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-06-02 16:08:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:08:48] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:08:48] [INFO ] [Real]Added 1010 Read/Feed constraints in 1104 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 224 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2025-06-02 16:08:49] [INFO ] Computed 39 invariants in 33 ms
[2025-06-02 16:08:49] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2035 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44202ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44434 ms. Remains : 160/170 places, 1875/1885 transitions.
[2025-06-02 16:09:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (119376 resets) in 6506 ms. (153 steps per ms)
BEST_FIRST walk for 1000001 steps (9743 resets) in 1152 ms. (867 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:09:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:09:40] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:09:40] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:09:41] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-02 16:09:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:09:41] [INFO ] [Real]Added 1010 Read/Feed constraints in 406 ms returned sat
[2025-06-02 16:09:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:09:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:09:41] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:09:42] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2025-06-02 16:09:46] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:09:46] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4754 ms returned sat
[2025-06-02 16:09:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 189 ms.
[2025-06-02 16:09:47] [INFO ] Added : 0 causal constraints over 0 iterations in 313 ms. Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 85 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 87 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 16:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:09:52] [INFO ] Implicit Places using invariants in 448 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 454 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 80 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 621 ms. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2025-06-02 16:09:52] [INFO ] Computed 29 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (119358 resets) in 6244 ms. (160 steps per ms)
BEST_FIRST walk for 1000001 steps (9744 resets) in 950 ms. (1051 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:09:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:09:59] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:09:59] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2025-06-02 16:09:59] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2025-06-02 16:09:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:10:00] [INFO ] [Real]Added 1010 Read/Feed constraints in 274 ms returned sat
[2025-06-02 16:10: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-02 16:10:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:10:00] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 6 ms returned sat
[2025-06-02 16:10:00] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2025-06-02 16:10:05] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:10:09] [INFO ] [Nat]Added 1010 Read/Feed constraints in 9091 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 80 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 68 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 16:10:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:10:10] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-06-02 16:10:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:10:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:10:50] [INFO ] Performed 10/150 implicitness test of which 0 returned IMPLICIT in 39 seconds.
[2025-06-02 16:11:22] [INFO ] Performed 21/150 implicitness test of which 0 returned IMPLICIT in 71 seconds.
[2025-06-02 16:11:56] [INFO ] Performed 25/150 implicitness test of which 0 returned IMPLICIT in 105 seconds.
[2025-06-02 16:12:33] [INFO ] Performed 28/150 implicitness test of which 0 returned IMPLICIT in 142 seconds.
[2025-06-02 16:12:33] [INFO ] Timeout of Implicit test with SMT after 142 seconds.
[2025-06-02 16:12:33] [INFO ] Implicit Places using invariants and state equation in 142898 ms returned []
Implicit Place search using SMT with State Equation took 143265 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:12:33] [INFO ] Redundant transitions in 42 ms returned []
Running 1830 sub problems to find dead transitions.
[2025-06-02 16:12:33] [INFO ] Invariant cache hit.
[2025-06-02 16:12:33] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2025 variables, 150/179 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SMT process timed out in 34158ms, After SMT, problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 34162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177553 ms. Remains : 150/150 places, 1875/1875 transitions.
[2025-06-02 16:13:07] [INFO ] Flatten gal took : 237 ms
RANDOM walk for 40000 steps (4782 resets) in 878 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (387 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
[2025-06-02 16:13:07] [INFO ] Flatten gal took : 97 ms
[2025-06-02 16:13:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17576162424391497470.gal : 17 ms
[2025-06-02 16:13:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3878733654037038992.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/ReachabilityCardinality17576162424391497470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3878733654037038992.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 (388 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3878733654037038992.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 43
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :43 after 77
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :77 after 94
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :94 after 164
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :164 after 581
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :581 after 839
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :839 after 1651
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1651 after 3049
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3049 after 4482
Interrupted probabilistic random walk after 275324 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 275324 steps, saw 66524 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2025-06-02 16:13:10] [INFO ] Invariant cache hit.
[2025-06-02 16:13:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2015 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2816 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4482 after 11577
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2015/2025 variables, and 1179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2421 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5277ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 174 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Running 1830 sub problems to find dead transitions.
[2025-06-02 16:13:16] [INFO ] Invariant cache hit.
[2025-06-02 16:13:16] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :11577 after 29800
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/2025 variables, and 29 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/150 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Detected timeout of ITS tools.
[2025-06-02 16:13:57] [INFO ] Flatten gal took : 93 ms
[2025-06-02 16:13:57] [INFO ] Applying decomposition
[2025-06-02 16:13:58] [INFO ] Flatten gal took : 93 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/graph357407518602405886.txt' '-o' '/tmp/graph357407518602405886.bin' '-w' '/tmp/graph357407518602405886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph357407518602405886.bin' '-l' '-1' '-v' '-w' '/tmp/graph357407518602405886.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:13:58] [INFO ] Decomposing Gal with order
[2025-06-02 16:13:58] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
[2025-06-02 16:13:59] [INFO ] Removed a total of 4440 redundant transitions.
[2025-06-02 16:13:59] [INFO ] Flatten gal took : 827 ms
[2025-06-02 16:14:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1025 labels/synchronizations in 471 ms.
At refinement iteration 3 (OVERLAPS) 1875/2025 variables, 150/179 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
[2025-06-02 16:14:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4174040743310911163.gal : 25 ms
[2025-06-02 16:14:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11719982887384544518.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/ReachabilityCardinality4174040743310911163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11719982887384544518.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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44639ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44820 ms. Remains : 150/150 places, 1875/1875 transitions.
Loading property file /tmp/ReachabilityCardinality11719982887384544518.prop.
RANDOM walk for 40000 steps (4745 resets) in 501 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (387 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (388 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 37
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :37 after 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 54
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :54 after 176
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :176 after 232
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :232 after 336
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :336 after 1086
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1086 after 1916
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1916 after 5022
Interrupted probabilistic random walk after 294830 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 294830 steps, saw 71024 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2025-06-02 16:14:04] [INFO ] Invariant cache hit.
[2025-06-02 16:14:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2015 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5022 after 12965
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12965 after 17021
At refinement iteration 8 (OVERLAPS) 10/2025 variables, 10/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2025 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2025 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4174 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2015 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/2025 variables, 10/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2025 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2025 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4662 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8856ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 69 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 66 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 16:14:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:14:13] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-06-02 16:14:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:14:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :17021 after 29768
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :29768 after 39966
Detected timeout of ITS tools.
[2025-06-02 16:14:54] [INFO ] Performed 10/150 implicitness test of which 0 returned IMPLICIT in 40 seconds.
[2025-06-02 16:15:34] [INFO ] Performed 17/150 implicitness test of which 0 returned IMPLICIT in 80 seconds.
[2025-06-02 16:16:11] [INFO ] Performed 22/150 implicitness test of which 0 returned IMPLICIT in 117 seconds.
[2025-06-02 16:16:48] [INFO ] Performed 27/150 implicitness test of which 0 returned IMPLICIT in 154 seconds.
[2025-06-02 16:16:48] [INFO ] Timeout of Implicit test with SMT after 154 seconds.
[2025-06-02 16:16:48] [INFO ] Implicit Places using invariants and state equation in 155377 ms returned []
Implicit Place search using SMT with State Equation took 155747 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:16:48] [INFO ] Redundant transitions in 32 ms returned []
Running 1830 sub problems to find dead transitions.
[2025-06-02 16:16:48] [INFO ] Invariant cache hit.
[2025-06-02 16:16:48] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2025 variables, 150/179 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SMT process timed out in 34220ms, After SMT, problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 34225ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190081 ms. Remains : 150/150 places, 1875/1875 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[10]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-00 in 516113 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 1885 rows 170 cols
[2025-06-02 16:17:23] [INFO ] Computed 39 invariants in 143 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1199 resets) in 64 ms. (153 steps per ms)
BEST_FIRST walk for 10000 steps (70 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:17:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:23] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:17:23] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:17:23] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-06-02 16:17:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:17:24] [INFO ] [Real]Added 1010 Read/Feed constraints in 256 ms returned sat
[2025-06-02 16:17:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:17:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:17:24] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:17:24] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2025-06-02 16:17:25] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:17:25] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1095 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 76 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:17:25] [INFO ] Invariant cache hit.
[2025-06-02 16:17:25] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44268ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44271ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44351 ms. Remains : 170/170 places, 1885/1885 transitions.
[2025-06-02 16:18:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (119328 resets) in 6487 ms. (154 steps per ms)
BEST_FIRST walk for 1000001 steps (7077 resets) in 926 ms. (1078 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:18:17] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:18:17] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:18:17] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2025-06-02 16:18:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:18:18] [INFO ] [Real]Added 1010 Read/Feed constraints in 242 ms returned sat
[2025-06-02 16:18:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:18:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:18:18] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:18:18] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2025-06-02 16:18:19] [INFO ] [Nat]Added 1010 Read/Feed constraints in 977 ms returned sat
[2025-06-02 16:18:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 388 ms.
[2025-06-02 16:18:19] [INFO ] Added : 0 causal constraints over 0 iterations in 539 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 88 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 72 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:18:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:24] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-06-02 16:18:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:18:55] [INFO ] Performed 16/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 16:19:26] [INFO ] Performed 25/170 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-02 16:19:46] [INFO ] Implicit Places using invariants and state equation in 81587 ms returned []
Implicit Place search using SMT with State Equation took 81968 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:19:46] [INFO ] Redundant transitions in 39 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:19:46] [INFO ] Invariant cache hit.
[2025-06-02 16:19:46] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34394ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34399ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116495 ms. Remains : 170/170 places, 1885/1885 transitions.
[2025-06-02 16:20:21] [INFO ] Flatten gal took : 88 ms
RANDOM walk for 40000 steps (4761 resets) in 489 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (284 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
[2025-06-02 16:20:21] [INFO ] Flatten gal took : 90 ms
[2025-06-02 16:20:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1620397807844182558.gal : 13 ms
[2025-06-02 16:20:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2249903598221583087.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/ReachabilityCardinality1620397807844182558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2249903598221583087.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
BEST_FIRST walk for 40004 steps (279 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2249903598221583087.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 49
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :49 after 217
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :217 after 263
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :263 after 389
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :389 after 1305
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1305 after 2791
Interrupted probabilistic random walk after 274482 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 274482 steps, saw 69231 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2025-06-02 16:20:24] [INFO ] Invariant cache hit.
[2025-06-02 16:20:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2791 after 7485
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7485 after 13700
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2462 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5503ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 82 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:20:29] [INFO ] Invariant cache hit.
[2025-06-02 16:20:29] [INFO ] State equation strengthened by 1010 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.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :13700 after 21482
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :21482 after 34433
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :34433 after 56797
Detected timeout of ITS tools.
[2025-06-02 16:21:11] [INFO ] Flatten gal took : 79 ms
[2025-06-02 16:21:11] [INFO ] Applying decomposition
[2025-06-02 16:21:11] [INFO ] Flatten gal took : 79 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/graph8757165715537426616.txt' '-o' '/tmp/graph8757165715537426616.bin' '-w' '/tmp/graph8757165715537426616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8757165715537426616.bin' '-l' '-1' '-v' '-w' '/tmp/graph8757165715537426616.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:21:11] [INFO ] Decomposing Gal with order
[2025-06-02 16:21:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:21:11] [INFO ] Removed a total of 2678 redundant transitions.
[2025-06-02 16:21:12] [INFO ] Flatten gal took : 329 ms
[2025-06-02 16:21:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-02 16:21:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10488965855398697889.gal : 12 ms
[2025-06-02 16:21:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7912536841079539641.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/ReachabilityCardinality10488965855398697889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7912536841079539641.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/ReachabilityCardinality7912536841079539641.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 35
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :35 after 201
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :201 after 227
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :227 after 264
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :264 after 369
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :369 after 1269
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1269 after 1646
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44226ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44231ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44318 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4790 resets) in 463 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (280 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (282 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1646 after 5643
Interrupted probabilistic random walk after 271315 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 271315 steps, saw 68640 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2025-06-02 16:21:17] [INFO ] Invariant cache hit.
[2025-06-02 16:21:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5643 after 10394
At refinement iteration 10 (OVERLAPS) 10/2055 variables, 10/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5927 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10394 after 25758
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13333 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19282ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 66 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 80 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:21:37] [INFO ] Implicit Places using invariants in 387 ms returned []
[2025-06-02 16:21:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:21:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :25758 after 43526
Detected timeout of ITS tools.
[2025-06-02 16:22:08] [INFO ] Performed 16/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 16:22:44] [INFO ] Performed 20/170 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2025-06-02 16:23:14] [INFO ] Performed 38/170 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2025-06-02 16:23:37] [INFO ] Implicit Places using invariants and state equation in 120699 ms returned []
Implicit Place search using SMT with State Equation took 121090 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:23:37] [INFO ] Redundant transitions in 34 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:23:37] [INFO ] Invariant cache hit.
[2025-06-02 16:23:37] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34109ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155365 ms. Remains : 170/170 places, 1885/1885 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[10]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-01 in 408832 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2025-06-02 16:24:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1188 resets) in 64 ms. (153 steps per ms)
BEST_FIRST walk for 10001 steps (96 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2025-06-02 16:24:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:24:12] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-06-02 16:24:12] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:24:12] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2025-06-02 16:24:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:24:13] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:24:13] [INFO ] [Real]Added 1010 Read/Feed constraints in 658 ms returned sat
[2025-06-02 16:24:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:24:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-02 16:24:13] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2025-06-02 16:24:13] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2025-06-02 16:24:14] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:24:14] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1092 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 152 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2025-06-02 16:24:14] [INFO ] Computed 39 invariants in 45 ms
[2025-06-02 16:24:14] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 timeout
0.0)
(s88 0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2035 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44244ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44404 ms. Remains : 160/170 places, 1875/1885 transitions.
[2025-06-02 16:24:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[10]
RANDOM walk for 1000000 steps (119298 resets) in 6479 ms. (154 steps per ms)
BEST_FIRST walk for 1000001 steps (10356 resets) in 989 ms. (1010 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2025-06-02 16:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:25:06] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:25:06] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:25:06] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2025-06-02 16:25:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:25:07] [INFO ] [Real]Added 1010 Read/Feed constraints in 580 ms returned sat
[2025-06-02 16:25: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-02 16:25:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:25:07] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:25:07] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2025-06-02 16:25:09] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1887 ms returned sat
[2025-06-02 16:25:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 186 ms.
[2025-06-02 16:25:10] [INFO ] Added : 0 causal constraints over 0 iterations in 325 ms. Result :sat
Minimization took 4512 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 86 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 74 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 16:25:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:15] [INFO ] Implicit Places using invariants in 380 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 383 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 149 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2025-06-02 16:25:15] [INFO ] Computed 29 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:15] [INFO ] Implicit Places using invariants in 383 ms returned []
[2025-06-02 16:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:26:01] [INFO ] Performed 8/140 implicitness test of which 0 returned IMPLICIT in 43 seconds.
[2025-06-02 16:26:33] [INFO ] Performed 10/140 implicitness test of which 0 returned IMPLICIT in 76 seconds.
[2025-06-02 16:27:09] [INFO ] Performed 13/140 implicitness test of which 0 returned IMPLICIT in 112 seconds.
[2025-06-02 16:27:41] [INFO ] Performed 15/140 implicitness test of which 0 returned IMPLICIT in 144 seconds.
[2025-06-02 16:27:41] [INFO ] Timeout of Implicit test with SMT after 144 seconds.
[2025-06-02 16:27:41] [INFO ] Implicit Places using invariants and state equation in 146042 ms returned []
Implicit Place search using SMT with State Equation took 146432 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 147039 ms. Remains : 140/160 places, 1865/1875 transitions.
[2025-06-02 16:27:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[10]
RANDOM walk for 1000000 steps (178915 resets) in 8399 ms. (119 steps per ms)
BEST_FIRST walk for 1000001 steps (14084 resets) in 859 ms. (1162 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2025-06-02 16:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:27:51] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:27:51] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2025-06-02 16:27:51] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2025-06-02 16:27:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:27:52] [INFO ] [Real]Added 1010 Read/Feed constraints in 455 ms returned sat
[2025-06-02 16:27:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:27:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:27:52] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 6 ms returned sat
[2025-06-02 16:27:52] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2025-06-02 16:27:53] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1303 ms returned sat
[2025-06-02 16:27:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 192 ms.
[2025-06-02 16:27:54] [INFO ] Added : 0 causal constraints over 0 iterations in 376 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 86 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 83 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2025-06-02 16:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:59] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-06-02 16:27:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:28:44] [INFO ] Performed 8/140 implicitness test of which 0 returned IMPLICIT in 43 seconds.
[2025-06-02 16:29:20] [INFO ] Performed 12/140 implicitness test of which 0 returned IMPLICIT in 79 seconds.
[2025-06-02 16:29:59] [INFO ] Performed 15/140 implicitness test of which 0 returned IMPLICIT in 118 seconds.
[2025-06-02 16:30:31] [INFO ] Performed 17/140 implicitness test of which 0 returned IMPLICIT in 150 seconds.
[2025-06-02 16:30:31] [INFO ] Timeout of Implicit test with SMT after 150 seconds.
[2025-06-02 16:30:31] [INFO ] Implicit Places using invariants and state equation in 152332 ms returned []
Implicit Place search using SMT with State Equation took 152672 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:30:31] [INFO ] Redundant transitions in 37 ms returned []
Running 1820 sub problems to find dead transitions.
[2025-06-02 16:30:31] [INFO ] Invariant cache hit.
[2025-06-02 16:30:31] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1865/2005 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
SMT process timed out in 34479ms, After SMT, problems are : Problem set: 0 solved, 1820 unsolved
Search for dead transitions found 0 dead transitions in 34483ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187288 ms. Remains : 140/140 places, 1865/1865 transitions.
[2025-06-02 16:31:06] [INFO ] Flatten gal took : 126 ms
[2025-06-02 16:31:06] [INFO ] Flatten gal took : 111 ms
[2025-06-02 16:31:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15972728314148458250.gal : 10 ms
[2025-06-02 16:31:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15483096512096898455.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/ReachabilityCardinality15972728314148458250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15483096512096898455.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
RANDOM walk for 40000 steps (7160 resets) in 893 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (560 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (560 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15483096512096898455.prop.
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 644 ms. (steps per millisecond=75 ) properties seen :0
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 34
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :34 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 62
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :62 after 110
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :110 after 239
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :239 after 404
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 569 ms. (steps per millisecond=85 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PhilosophersDyn-COL-10-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-10-UpperBounds-04 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-10-UpperBounds-08 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-10-UpperBounds-10 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-10-UpperBounds-02 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-02 in 415555 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 1885 rows 170 cols
[2025-06-02 16:31:07] [INFO ] Computed 39 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1201 resets) in 65 ms. (151 steps per ms)
BEST_FIRST walk for 10001 steps (71 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:31:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:31:07] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:31:07] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:31:08] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2025-06-02 16:31:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:31:08] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:31:08] [INFO ] [Real]Added 1010 Read/Feed constraints in 689 ms returned sat
[2025-06-02 16:31:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:31:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:31:08] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:31:09] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2025-06-02 16:31:09] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:31:10] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1081 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 148 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2025-06-02 16:31:10] [INFO ] Computed 39 invariants in 30 ms
[2025-06-02 16:31:10] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2035 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44130ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44286 ms. Remains : 160/170 places, 1875/1885 transitions.
[2025-06-02 16:31:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (119273 resets) in 6400 ms. (156 steps per ms)
BEST_FIRST walk for 1000001 steps (7462 resets) in 942 ms. (1060 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:01] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:32:01] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:32:02] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-06-02 16:32:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:32:02] [INFO ] [Real]Added 1010 Read/Feed constraints in 204 ms returned sat
[2025-06-02 16:32:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:32:02] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:32:02] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2025-06-02 16:32:07] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:32:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 8813 ms returned sat
[2025-06-02 16:32:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 191 ms.
[2025-06-02 16:32:12] [INFO ] Added : 0 causal constraints over 0 iterations in 327 ms. Result :sat
Minimization took 4515 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 86 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 81 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 16:32:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:32:17] [INFO ] Implicit Places using invariants in 417 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 420 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 80 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 581 ms. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2025-06-02 16:32:17] [INFO ] Computed 29 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (119385 resets) in 6446 ms. (155 steps per ms)
BEST_FIRST walk for 1000001 steps (7462 resets) in 894 ms. (1117 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:32:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:24] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:32:24] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2025-06-02 16:32:25] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2025-06-02 16:32:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:32:25] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2025-06-02 16:32:25] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2025-06-02 16:32:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:32:30] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:32:32] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6671 ms returned sat
[2025-06-02 16:32:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 194 ms.
[2025-06-02 16:32:32] [INFO ] Added : 0 causal constraints over 0 iterations in 351 ms. Result :sat
Minimization took 4511 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 77 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 70 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 16:32:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:32:37] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-06-02 16:32:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:32:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:33:13] [INFO ] Performed 11/150 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2025-06-02 16:33:54] [INFO ] Performed 19/150 implicitness test of which 0 returned IMPLICIT in 75 seconds.
[2025-06-02 16:34:28] [INFO ] Performed 29/150 implicitness test of which 0 returned IMPLICIT in 110 seconds.
[2025-06-02 16:35:01] [INFO ] Performed 32/150 implicitness test of which 0 returned IMPLICIT in 143 seconds.
[2025-06-02 16:35:01] [INFO ] Timeout of Implicit test with SMT after 143 seconds.
[2025-06-02 16:35:01] [INFO ] Implicit Places using invariants and state equation in 143654 ms returned []
Implicit Place search using SMT with State Equation took 143996 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:35:01] [INFO ] Redundant transitions in 33 ms returned []
Running 1830 sub problems to find dead transitions.
[2025-06-02 16:35:01] [INFO ] Invariant cache hit.
[2025-06-02 16:35:01] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2025 variables, 150/179 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SMT process timed out in 34286ms, After SMT, problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 34290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178403 ms. Remains : 150/150 places, 1875/1875 transitions.
[2025-06-02 16:35:35] [INFO ] Flatten gal took : 101 ms
RANDOM walk for 40000 steps (4784 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (296 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
[2025-06-02 16:35:35] [INFO ] Flatten gal took : 81 ms
BEST_FIRST walk for 40004 steps (296 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
[2025-06-02 16:35:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7078813864554766485.gal : 11 ms
[2025-06-02 16:35:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6669585299277976612.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/ReachabilityCardinality7078813864554766485.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6669585299277976612.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/ReachabilityCardinality6669585299277976612.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 43
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :43 after 77
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :77 after 94
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :94 after 164
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :164 after 581
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :581 after 839
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :839 after 1651
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1651 after 3049
Interrupted probabilistic random walk after 305845 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 2
Probabilistic random walk after 305845 steps, saw 73541 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2025-06-02 16:35:38] [INFO ] Invariant cache hit.
[2025-06-02 16:35:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3049 after 4482
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2015 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2856 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4482 after 11577
After SMT solving in domain Int declared 2015/2025 variables, and 1179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2431 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5305ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 70 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Running 1830 sub problems to find dead transitions.
[2025-06-02 16:35:44] [INFO ] Invariant cache hit.
[2025-06-02 16:35:44] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :11577 after 29800
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/2025 variables, and 29 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/150 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Detected timeout of ITS tools.
[2025-06-02 16:36:26] [INFO ] Flatten gal took : 81 ms
[2025-06-02 16:36:26] [INFO ] Applying decomposition
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
[2025-06-02 16:36:26] [INFO ] Flatten gal took : 78 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/graph4838937795619118054.txt' '-o' '/tmp/graph4838937795619118054.bin' '-w' '/tmp/graph4838937795619118054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4838937795619118054.bin' '-l' '-1' '-v' '-w' '/tmp/graph4838937795619118054.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:36:26] [INFO ] Decomposing Gal with order
[2025-06-02 16:36:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:36:26] [INFO ] Removed a total of 2750 redundant transitions.
[2025-06-02 16:36:26] [INFO ] Flatten gal took : 359 ms
[2025-06-02 16:36:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-02 16:36:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1838506584610735679.gal : 13 ms
[2025-06-02 16:36:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality304056844630674263.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/ReachabilityCardinality1838506584610735679.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality304056844630674263.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 ...327
Loading property file /tmp/ReachabilityCardinality304056844630674263.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :28 after 29
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :29 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 49
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :49 after 175
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :175 after 208
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :208 after 269
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :269 after 836
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :836 after 1012
At refinement iteration 3 (OVERLAPS) 1875/2025 variables, 150/179 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1012 after 2435
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 720/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44589ms problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44593ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44667 ms. Remains : 150/150 places, 1875/1875 transitions.
RANDOM walk for 40000 steps (4764 resets) in 434 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (296 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (296 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2435 after 5532
Interrupted probabilistic random walk after 300889 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 300889 steps, saw 72647 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2025-06-02 16:36:32] [INFO ] Invariant cache hit.
[2025-06-02 16:36:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2015 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5532 after 13574
At refinement iteration 8 (OVERLAPS) 10/2025 variables, 10/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2025 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2025 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 1189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4852 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1875/2015 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2015 variables, 1010/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 2/1181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2015 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13574 after 30353
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 1191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25699 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 150/150 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30586ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 76 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 65 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 16:37:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:37:03] [INFO ] Implicit Places using invariants in 338 ms returned []
[2025-06-02 16:37:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:37:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-02 16:37:44] [INFO ] Performed 10/150 implicitness test of which 0 returned IMPLICIT in 40 seconds.
[2025-06-02 16:38:22] [INFO ] Performed 25/150 implicitness test of which 0 returned IMPLICIT in 79 seconds.
[2025-06-02 16:38:55] [INFO ] Performed 27/150 implicitness test of which 0 returned IMPLICIT in 111 seconds.
[2025-06-02 16:39:29] [INFO ] Performed 29/150 implicitness test of which 0 returned IMPLICIT in 145 seconds.
[2025-06-02 16:39:29] [INFO ] Timeout of Implicit test with SMT after 145 seconds.
[2025-06-02 16:39:29] [INFO ] Implicit Places using invariants and state equation in 145896 ms returned []
Implicit Place search using SMT with State Equation took 146246 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:39:29] [INFO ] Redundant transitions in 37 ms returned []
Running 1830 sub problems to find dead transitions.
[2025-06-02 16:39:29] [INFO ] Invariant cache hit.
[2025-06-02 16:39:29] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2025 variables, 150/179 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SMT process timed out in 34280ms, After SMT, problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 34285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180658 ms. Remains : 150/150 places, 1875/1875 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[10]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-05 in 535790 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 1885 rows 170 cols
[2025-06-02 16:40:03] [INFO ] Computed 39 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1197 resets) in 67 ms. (147 steps per ms)
BEST_FIRST walk for 10001 steps (101 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2025-06-02 16:40:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:40:03] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:40:03] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:40:03] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2025-06-02 16:40:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:40:04] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:40:04] [INFO ] [Real]Added 1010 Read/Feed constraints in 1088 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 65 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:40:05] [INFO ] Invariant cache hit.
[2025-06-02 16:40:05] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44084ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44156 ms. Remains : 170/170 places, 1885/1885 transitions.
[2025-06-02 16:40:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[10]
RANDOM walk for 1000000 steps (119309 resets) in 6460 ms. (154 steps per ms)
BEST_FIRST walk for 1000001 steps (10029 resets) in 1022 ms. (977 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2025-06-02 16:40:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:40:56] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:40:56] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:40:57] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2025-06-02 16:40:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:40:58] [INFO ] [Real]Added 1010 Read/Feed constraints in 1289 ms returned sat
[2025-06-02 16:40: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-02 16:40:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:40:58] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:40:58] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2025-06-02 16:41:00] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1279 ms returned sat
[2025-06-02 16:41:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 192 ms.
[2025-06-02 16:41:00] [INFO ] Added : 0 causal constraints over 0 iterations in 322 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 113 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 72 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:41:05] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-06-02 16:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:41:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:41:37] [INFO ] Performed 15/170 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2025-06-02 16:42:17] [INFO ] Performed 21/170 implicitness test of which 0 returned IMPLICIT in 70 seconds.
[2025-06-02 16:43:00] [INFO ] Performed 29/170 implicitness test of which 0 returned IMPLICIT in 113 seconds.
[2025-06-02 16:43:39] [INFO ] Performed 34/170 implicitness test of which 0 returned IMPLICIT in 153 seconds.
[2025-06-02 16:43:39] [INFO ] Timeout of Implicit test with SMT after 153 seconds.
[2025-06-02 16:43:39] [INFO ] Implicit Places using invariants and state equation in 154280 ms returned []
Implicit Place search using SMT with State Equation took 154651 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:43:39] [INFO ] Redundant transitions in 35 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:43:39] [INFO ] Invariant cache hit.
[2025-06-02 16:43:39] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34503ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189281 ms. Remains : 170/170 places, 1885/1885 transitions.
[2025-06-02 16:44:14] [INFO ] Flatten gal took : 79 ms
RANDOM walk for 40000 steps (4775 resets) in 405 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (396 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2025-06-02 16:44:14] [INFO ] Flatten gal took : 90 ms
BEST_FIRST walk for 40003 steps (396 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
[2025-06-02 16:44:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12842774289978165790.gal : 12 ms
[2025-06-02 16:44:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3858327661580681256.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/ReachabilityCardinality12842774289978165790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3858327661580681256.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/ReachabilityCardinality3858327661580681256.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 49
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :49 after 217
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :217 after 263
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :263 after 389
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :389 after 1305
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1305 after 2791
Interrupted probabilistic random walk after 272854 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 272854 steps, saw 68913 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2025-06-02 16:44:17] [INFO ] Invariant cache hit.
[2025-06-02 16:44:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2791 after 7485
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2950 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7485 after 13700
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2466 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5436ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 79 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:44:23] [INFO ] Invariant cache hit.
[2025-06-02 16:44:23] [INFO ] State equation strengthened by 1010 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.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :13700 after 21482
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :21482 after 34433
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 2.0)
(s121 2.0)
(s122 2.0)
(s123 2.0)
(s124 2.0)
(s125 2.0)
(s126 2.0)
(s127 2.0)
(s128 2.0)
(s129 2.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :34433 after 56797
Detected timeout of ITS tools.
[2025-06-02 16:45:04] [INFO ] Flatten gal took : 79 ms
[2025-06-02 16:45:04] [INFO ] Applying decomposition
[2025-06-02 16:45:04] [INFO ] Flatten gal took : 90 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/graph12760825752667765518.txt' '-o' '/tmp/graph12760825752667765518.bin' '-w' '/tmp/graph12760825752667765518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12760825752667765518.bin' '-l' '-1' '-v' '-w' '/tmp/graph12760825752667765518.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:45:04] [INFO ] Decomposing Gal with order
[2025-06-02 16:45:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:45:05] [INFO ] Removed a total of 2836 redundant transitions.
[2025-06-02 16:45:05] [INFO ] Flatten gal took : 347 ms
[2025-06-02 16:45:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 19 ms.
[2025-06-02 16:45:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7451311608737164658.gal : 14 ms
[2025-06-02 16:45:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7095642046906129325.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/ReachabilityCardinality7451311608737164658.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7095642046906129325.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/ReachabilityCardinality7095642046906129325.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 37
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :37 after 42
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :42 after 47
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :47 after 49
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :49 after 64
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :64 after 228
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :228 after 261
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :261 after 335
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :335 after 476
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :476 after 1501
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44188ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44294 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4780 resets) in 456 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (398 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (393 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1501 after 4182
Interrupted probabilistic random walk after 270095 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 270095 steps, saw 68423 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2025-06-02 16:45:10] [INFO ] Invariant cache hit.
[2025-06-02 16:45:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4182 after 9002
At refinement iteration 10 (OVERLAPS) 10/2055 variables, 10/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3086 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/75 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/160 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9002 after 22208
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18455 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21564ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 80 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 73 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:45:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:45:32] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-02 16:45:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:45:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :22208 after 38831
Detected timeout of ITS tools.
[2025-06-02 16:46:04] [INFO ] Performed 15/170 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2025-06-02 16:46:35] [INFO ] Performed 22/170 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2025-06-02 16:47:06] [INFO ] Performed 41/170 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2025-06-02 16:47:20] [INFO ] Implicit Places using invariants and state equation in 108128 ms returned []
Implicit Place search using SMT with State Equation took 108493 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:47:20] [INFO ] Redundant transitions in 35 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:47:20] [INFO ] Invariant cache hit.
[2025-06-02 16:47:20] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34144ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142771 ms. Remains : 170/170 places, 1885/1885 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[10]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-09 in 471515 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2025-06-02 16:47:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (1193 resets) in 71 ms. (138 steps per ms)
BEST_FIRST walk for 10001 steps (90 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:47:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:47:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:47:55] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2025-06-02 16:47:55] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2025-06-02 16:47:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:47:55] [INFO ] [Real]Added 1010 Read/Feed constraints in 371 ms returned sat
[2025-06-02 16:47:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:47:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:47:55] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:47:56] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2025-06-02 16:47:56] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:47:57] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1090 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 153 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2025-06-02 16:47:57] [INFO ] Computed 39 invariants in 31 ms
[2025-06-02 16:47:57] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2035 variables, and 39 constraints, problems are : Problem set: 0 solved, 1830 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1830/1110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1830 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2035 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SMT process timed out in 44246ms, After SMT, problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 44250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44407 ms. Remains : 160/170 places, 1875/1885 transitions.
[2025-06-02 16:48:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (119352 resets) in 7217 ms. (138 steps per ms)
BEST_FIRST walk for 1000000 steps (9407 resets) in 1932 ms. (517 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:48:50] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:48:50] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:48:51] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-06-02 16:48:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:48:51] [INFO ] [Real]Added 1010 Read/Feed constraints in 435 ms returned sat
[2025-06-02 16:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:48:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:48:51] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:48:52] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2025-06-02 16:48:56] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:49:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 9103 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 90 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 68 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2025-06-02 16:49:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:49:01] [INFO ] Implicit Places using invariants in 239 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 244 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 148 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2025-06-02 16:49:01] [INFO ] Computed 29 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:49:01] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-06-02 16:49:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:49:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:49:35] [INFO ] Performed 107/140 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-02 16:50:20] [INFO ] Performed 111/140 implicitness test of which 0 returned IMPLICIT in 76 seconds.
[2025-06-02 16:50:55] [INFO ] Performed 114/140 implicitness test of which 0 returned IMPLICIT in 111 seconds.
[2025-06-02 16:51:35] [INFO ] Performed 119/140 implicitness test of which 0 returned IMPLICIT in 152 seconds.
[2025-06-02 16:51:35] [INFO ] Timeout of Implicit test with SMT after 152 seconds.
[2025-06-02 16:51:35] [INFO ] Implicit Places using invariants and state equation in 153656 ms returned []
Implicit Place search using SMT with State Equation took 153896 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 154358 ms. Remains : 140/160 places, 1865/1875 transitions.
[2025-06-02 16:51:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (178989 resets) in 9413 ms. (106 steps per ms)
BEST_FIRST walk for 1000001 steps (11363 resets) in 1888 ms. (529 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2025-06-02 16:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:51:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:51:46] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2025-06-02 16:51:47] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2025-06-02 16:51:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:51:48] [INFO ] [Real]Added 1010 Read/Feed constraints in 899 ms returned sat
[2025-06-02 16:51: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-02 16:51:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:51:48] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2025-06-02 16:51:48] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-06-02 16:51:49] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1170 ms returned sat
[2025-06-02 16:51:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 187 ms.
[2025-06-02 16:51:50] [INFO ] Added : 0 causal constraints over 0 iterations in 324 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 80 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 76 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2025-06-02 16:51:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:51:54] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-02 16:51:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:51:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:52:28] [INFO ] Performed 108/140 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-02 16:52:59] [INFO ] Performed 116/140 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2025-06-02 16:53:40] [INFO ] Performed 122/140 implicitness test of which 0 returned IMPLICIT in 103 seconds.
[2025-06-02 16:54:12] [INFO ] Performed 124/140 implicitness test of which 0 returned IMPLICIT in 136 seconds.
[2025-06-02 16:54:12] [INFO ] Timeout of Implicit test with SMT after 136 seconds.
[2025-06-02 16:54:12] [INFO ] Implicit Places using invariants and state equation in 137633 ms returned []
Implicit Place search using SMT with State Equation took 137842 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:54:12] [INFO ] Redundant transitions in 34 ms returned []
Running 1820 sub problems to find dead transitions.
[2025-06-02 16:54:12] [INFO ] Invariant cache hit.
[2025-06-02 16:54:12] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1865/2005 variables, 140/169 constraints. Problems are: Problem set: 0 solved, 1820 unsolved
SMT process timed out in 34461ms, After SMT, problems are : Problem set: 0 solved, 1820 unsolved
Search for dead transitions found 0 dead transitions in 34465ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172437 ms. Remains : 140/140 places, 1865/1865 transitions.
[2025-06-02 16:54:47] [INFO ] Flatten gal took : 84 ms
[2025-06-02 16:54:47] [INFO ] Flatten gal took : 102 ms
[2025-06-02 16:54:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1998762595567584363.gal : 12 ms
[2025-06-02 16:54:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8510143268593085412.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/ReachabilityCardinality1998762595567584363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8510143268593085412.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (7173 resets) in 630 ms. (63 steps per ms) remains 2/2 properties
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
BEST_FIRST walk for 40004 steps (452 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (452 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8510143268593085412.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 34
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :34 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 62
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :62 after 110
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 619 ms. (steps per millisecond=78 ) properties seen :0
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :110 after 239
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :239 after 404
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 600 ms. (steps per millisecond=80 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PhilosophersDyn-COL-10-UpperBounds-12 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-12 in 413783 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 1885 rows 170 cols
[2025-06-02 16:54:48] [INFO ] Computed 39 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1195 resets) in 65 ms. (151 steps per ms)
BEST_FIRST walk for 10001 steps (85 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-02 16:54:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:54:48] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:54:48] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:54:49] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2025-06-02 16:54:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:54:49] [INFO ] [Real]Added 1010 Read/Feed constraints in 318 ms returned sat
[2025-06-02 16:54: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-02 16:54:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:54:49] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:54:49] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2025-06-02 16:54:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 16:54:51] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1090 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 72 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:54:51] [INFO ] Invariant cache hit.
[2025-06-02 16:54:51] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44344ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44424 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2025-06-02 16:55:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (119428 resets) in 6436 ms. (155 steps per ms)
BEST_FIRST walk for 1000001 steps (8515 resets) in 1028 ms. (971 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-02 16:55:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:55:43] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 16:55:43] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:55:44] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-06-02 16:55:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:55:44] [INFO ] [Real]Added 1010 Read/Feed constraints in 278 ms returned sat
[2025-06-02 16:55:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:55:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 16:55:44] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2025-06-02 16:55:44] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2025-06-02 16:55:46] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1869 ms returned sat
[2025-06-02 16:55:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 198 ms.
[2025-06-02 16:55:47] [INFO ] Added : 0 causal constraints over 0 iterations in 350 ms. Result :sat
Minimization took 4504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 89 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 77 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:55:52] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-06-02 16:55:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:55:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-02 16:56:23] [INFO ] Performed 15/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 16:56:53] [INFO ] Performed 26/170 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2025-06-02 16:57:28] [INFO ] Performed 51/170 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2025-06-02 16:57:45] [INFO ] Implicit Places using invariants and state equation in 113021 ms returned []
Implicit Place search using SMT with State Equation took 113349 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:57:45] [INFO ] Redundant transitions in 37 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:57:45] [INFO ] Invariant cache hit.
[2025-06-02 16:57:45] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34278ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147762 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2025-06-02 16:58:20] [INFO ] Flatten gal took : 87 ms
RANDOM walk for 40000 steps (4778 resets) in 364 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (339 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2025-06-02 16:58:20] [INFO ] Flatten gal took : 86 ms
[2025-06-02 16:58:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14036450905172795904.gal : 12 ms
[2025-06-02 16:58:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality39153445885332814.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/ReachabilityCardinality14036450905172795904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality39153445885332814.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 ...327
Loading property file /tmp/ReachabilityCardinality39153445885332814.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :32 after 39
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :39 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 49
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :49 after 217
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :217 after 263
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :263 after 389
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :389 after 1305
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1305 after 2791
Interrupted probabilistic random walk after 335593 steps, run timeout after 3008 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 335593 steps, saw 84495 distinct states, run finished after 3008 ms. (steps per millisecond=111 ) properties seen :0
[2025-06-02 16:58:23] [INFO ] Invariant cache hit.
[2025-06-02 16:58:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1065/1075 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1075 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 980/2055 variables, 160/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2055 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 30/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 990/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1065/1075 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1075 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2791 after 7485
At refinement iteration 4 (OVERLAPS) 980/2055 variables, 160/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2055 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 30/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2294ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2025-06-02 16:58:25] [INFO ] Invariant cache hit.
[2025-06-02 16:58:25] [INFO ] State equation strengthened by 1010 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.
SDD proceeding with computation,1 properties remain. new max is 4096
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD size :7485 after 13700
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :13700 after 21482
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :21482 after 34433
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43995ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44073 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4760 resets) in 415 ms. (96 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (338 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :34433 after 56797
Detected timeout of ITS tools.
[2025-06-02 16:59:10] [INFO ] Flatten gal took : 84 ms
[2025-06-02 16:59:10] [INFO ] Applying decomposition
[2025-06-02 16:59:10] [INFO ] Flatten gal took : 84 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/graph17599002303636526500.txt' '-o' '/tmp/graph17599002303636526500.bin' '-w' '/tmp/graph17599002303636526500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17599002303636526500.bin' '-l' '-1' '-v' '-w' '/tmp/graph17599002303636526500.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:59:10] [INFO ] Decomposing Gal with order
[2025-06-02 16:59:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:59:11] [INFO ] Removed a total of 4562 redundant transitions.
[2025-06-02 16:59:11] [INFO ] Flatten gal took : 290 ms
[2025-06-02 16:59:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 38 ms.
[2025-06-02 16:59:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10879003635251889407.gal : 14 ms
[2025-06-02 16:59:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1539515031520726863.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/ReachabilityCardinality10879003635251889407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1539515031520726863.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/ReachabilityCardinality1539515031520726863.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 46
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :46 after 62
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :62 after 128
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :128 after 149
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :149 after 224
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :224 after 478
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :478 after 1034
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1034 after 1534
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1534 after 3830
Interrupted probabilistic random walk after 333747 steps, run timeout after 3009 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 333747 steps, saw 83945 distinct states, run finished after 3009 ms. (steps per millisecond=110 ) properties seen :0
[2025-06-02 16:59:12] [INFO ] Invariant cache hit.
[2025-06-02 16:59:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1065/1075 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1075 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3830 after 5464
At refinement iteration 4 (OVERLAPS) 980/2055 variables, 160/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2055 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 30/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 990/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1065/1075 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1075 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 980/2055 variables, 160/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2055 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 30/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5464 after 7670
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 990/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2931 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3655ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 71 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 68 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-06-02 16:59:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:59:16] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-02 16:59:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:59:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7670 after 12405
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :12405 after 25717
[2025-06-02 16:59:48] [INFO ] Performed 15/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2025-06-02 17:00:19] [INFO ] Performed 22/170 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2025-06-02 17:00:49] [INFO ] Performed 41/170 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2025-06-02 17:00:59] [INFO ] Implicit Places using invariants and state equation in 102248 ms returned []
Implicit Place search using SMT with State Equation took 102557 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:00:59] [INFO ] Redundant transitions in 37 ms returned []
Running 1840 sub problems to find dead transitions.
[2025-06-02 17:00:59] [INFO ] Invariant cache hit.
[2025-06-02 17:00:59] [INFO ] State equation strengthened by 1010 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34670ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34676ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137353 ms. Remains : 170/170 places, 1885/1885 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-14 in 405283 ms.
[2025-06-02 17:01:34] [INFO ] Flatten gal took : 77 ms
[2025-06-02 17:01:34] [INFO ] Applying decomposition
[2025-06-02 17:01:34] [INFO ] Flatten gal took : 98 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/graph13100578929683379672.txt' '-o' '/tmp/graph13100578929683379672.bin' '-w' '/tmp/graph13100578929683379672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13100578929683379672.bin' '-l' '-1' '-v' '-w' '/tmp/graph13100578929683379672.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:01:34] [INFO ] Decomposing Gal with order
[2025-06-02 17:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:01:34] [INFO ] Removed a total of 3026 redundant transitions.
[2025-06-02 17:01:34] [INFO ] Flatten gal took : 308 ms
[2025-06-02 17:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-02 17:01:34] [INFO ] Time to serialize gal into /tmp/UpperBounds10286389619739142545.gal : 11 ms
[2025-06-02 17:01:34] [INFO ] Time to serialize properties into /tmp/UpperBounds15917771831729456517.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/UpperBounds10286389619739142545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15917771831729456517.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 ...306
Loading property file /tmp/UpperBounds15917771831729456517.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="PhilosophersDyn-COL-10"
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 PhilosophersDyn-COL-10, 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 r156-tall-174881253600205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 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 ;