About the Execution of 2024-gold for DoubleLock-PT-p2s1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15685.740 | 3600000.00 | 3986566.00 | 11724.10 | 10 0 1 1 ? 1 inf 1 1 1 1 ? inf ? 10 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079700069.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 gold2024
Input is DoubleLock-PT-p2s1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700069
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 97K 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 DoubleLock-PT-p2s1-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p2s1-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748732792171
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 23:06:33] [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-05-31 23:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:06:33] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2025-05-31 23:06:33] [INFO ] Transformed 64 places.
[2025-05-31 23:06:33] [INFO ] Transformed 212 transitions.
[2025-05-31 23:06:33] [INFO ] Parsed PT model containing 64 places and 212 transitions and 860 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
FORMULA DoubleLock-PT-p2s1-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:06:33] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
// Phase 1: matrix 152 rows 56 cols
[2025-05-31 23:06:33] [INFO ] Computed 4 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 1, 1, +inf, 1, +inf, 1, 1, 1, 1, +inf, +inf, +inf, 10, +inf]
RANDOM walk for 10000 steps (57 resets) in 46 ms. (212 steps per ms)
FORMULA DoubleLock-PT-p2s1-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s1-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (55 resets) in 95 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 8, 6, 8, 6, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:06:33] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2025-05-31 23:06:33] [INFO ] Invariant cache hit.
[2025-05-31 23:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 23:06:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-05-31 23:06:34] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-31 23:06:34] [INFO ] [Real]Added 27 Read/Feed constraints in 10 ms returned sat
[2025-05-31 23:06:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:06:34] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 6 ms to minimize.
[2025-05-31 23:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2025-05-31 23:06:34] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 18 ms.
[2025-05-31 23:06:34] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2025-05-31 23:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-05-31 23:06:34] [INFO ] Added : 11 causal constraints over 3 iterations in 162 ms. Result :sat
Minimization took 34 ms.
[2025-05-31 23:06:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:06:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:06:34] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-05-31 23:06:34] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 15 ms.
[2025-05-31 23:06:34] [INFO ] Added : 27 causal constraints over 6 iterations in 105 ms. Result :sat
Minimization took 36 ms.
[2025-05-31 23:06:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-31 23:06:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-05-31 23:06:34] [INFO ] [Nat]Added 27 Read/Feed constraints in 13 ms returned sat
[2025-05-31 23:06:35] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:06:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2025-05-31 23:06:35] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 18 ms.
[2025-05-31 23:06:35] [INFO ] Added : 43 causal constraints over 9 iterations in 130 ms. Result :sat
Minimization took 43 ms.
[2025-05-31 23:06:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 23:06:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:06:35] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:06:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2025-05-31 23:06:35] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 16 ms.
[2025-05-31 23:06:35] [INFO ] Added : 10 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 32 ms.
[2025-05-31 23:06:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 23:06:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:06:35] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:06:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-05-31 23:06:35] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 15 ms.
[2025-05-31 23:06:35] [INFO ] Added : 11 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 32 ms.
[2025-05-31 23:06:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 23:06:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-05-31 23:06:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:06:35] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:06:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2025-05-31 23:06:36] [INFO ] Computed and/alt/rep : 67/466/67 causal constraints (skipped 83 transitions) in 15 ms.
[2025-05-31 23:06:36] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:06:36] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:06:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2025-05-31 23:06:36] [INFO ] Added : 27 causal constraints over 6 iterations in 206 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 8, 6, 8, 6, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 19, 6, 8, 6, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 204/204 transitions.
Graph (complete) has 357 edges and 56 vertex of which 52 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 52 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 194
Applied a total of 7 rules in 31 ms. Remains 50 /56 variables (removed 6) and now considering 194/204 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 50/56 places, 194/204 transitions.
[2025-05-31 23:06:36] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {12=1, 25=1, 87=1, 88=1, 133=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {12=1, 25=1, 93=1, 94=1, 141=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 31 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :[6, 5, 4, 8, 3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 19, 6, 8, 6, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:06:36] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
// Phase 1: matrix 145 rows 50 cols
[2025-05-31 23:06:36] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 19, 6, 8, 6, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2799 resets) in 1430 ms. (698 steps per ms)
BEST_FIRST walk for 6000004 steps (1228 resets) in 2630 ms. (2280 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 46, 45, 45, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:06:40] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:06:40] [INFO ] Invariant cache hit.
[2025-05-31 23:06:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:40] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 23:06:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:40] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-05-31 23:06:40] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:06:40] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:06:40] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 13 ms.
[2025-05-31 23:06:40] [INFO ] Added : 36 causal constraints over 8 iterations in 112 ms. Result :sat
Minimization took 56 ms.
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:06:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2025-05-31 23:06:41] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 17 ms.
[2025-05-31 23:06:41] [INFO ] Added : 47 causal constraints over 10 iterations in 146 ms. Result :sat
Minimization took 49 ms.
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:06:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2025-05-31 23:06:41] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 12 ms.
[2025-05-31 23:06:41] [INFO ] Added : 28 causal constraints over 6 iterations in 80 ms. Result :sat
Minimization took 42 ms.
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:06:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:06:41] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 19 ms.
[2025-05-31 23:06:41] [INFO ] Added : 45 causal constraints over 10 iterations in 136 ms. Result :sat
Minimization took 44 ms.
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:06:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:41] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:06:42] [INFO ] [Nat]Added 26 Read/Feed constraints in 11 ms returned sat
[2025-05-31 23:06:42] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-31 23:06:42] [INFO ] Added : 24 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 40 ms.
[2025-05-31 23:06:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:42] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:06:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:42] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:06:42] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:06:42] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 10 ms.
[2025-05-31 23:06:42] [INFO ] Added : 47 causal constraints over 10 iterations in 120 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11, 46, 45, 45, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 3440, 45, 45, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 50/50 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-05-31 23:06:42] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:06:42] [INFO ] Invariant cache hit.
[2025-05-31 23:06:42] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-31 23:06:42] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:06:42] [INFO ] Invariant cache hit.
[2025-05-31 23:06:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:06:42] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2025-05-31 23:06:42] [INFO ] Redundant transitions in 6 ms returned []
Running 192 sub problems to find dead transitions.
[2025-05-31 23:06:42] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:06:42] [INFO ] Invariant cache hit.
[2025-05-31 23:06:42] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 78 constraints, problems are : Problem set: 0 solved, 192 unsolved in 2849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 192/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 270 constraints, problems are : Problem set: 0 solved, 192 unsolved in 5040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 8062ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 8071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8251 ms. Remains : 50/50 places, 194/194 transitions.
[2025-05-31 23:06:50] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {12=1, 25=1, 87=1, 88=1, 133=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {12=1, 25=1, 93=1, 94=1, 141=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 38 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :[4, 5, 5, 6, 4, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[11, 3440, 45, 45, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:06:51] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:06:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11, 3440, 45, 45, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2794 resets) in 1383 ms. (722 steps per ms)
BEST_FIRST walk for 6000006 steps (1244 resets) in 2607 ms. (2300 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 3440, 54, 62, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:06:55] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:06:55] [INFO ] Invariant cache hit.
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:06:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 23:06:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:06:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:06:55] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 10 ms.
[2025-05-31 23:06:55] [INFO ] Added : 36 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 58 ms.
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-05-31 23:06:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:06:55] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-31 23:06:55] [INFO ] Added : 47 causal constraints over 10 iterations in 120 ms. Result :sat
Minimization took 49 ms.
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-05-31 23:06:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:06:55] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 16 ms.
[2025-05-31 23:06:55] [INFO ] Added : 20 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 35 ms.
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 23:06:55] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:06:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:06:56] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 10 ms.
[2025-05-31 23:06:56] [INFO ] Added : 35 causal constraints over 7 iterations in 83 ms. Result :sat
Minimization took 48 ms.
[2025-05-31 23:06:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:06:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:06:56] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 10 ms.
[2025-05-31 23:06:56] [INFO ] Added : 24 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 38 ms.
[2025-05-31 23:06:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 23:06:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:06:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:06:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:06:56] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-31 23:06:56] [INFO ] Added : 47 causal constraints over 10 iterations in 119 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11, 3440, 54, 62, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 285941, 54, 62, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 50/50 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-05-31 23:07:00] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:00] [INFO ] Invariant cache hit.
[2025-05-31 23:07:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-31 23:07:00] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:00] [INFO ] Invariant cache hit.
[2025-05-31 23:07:01] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:07:01] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2025-05-31 23:07:01] [INFO ] Redundant transitions in 7 ms returned []
Running 192 sub problems to find dead transitions.
[2025-05-31 23:07:01] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:01] [INFO ] Invariant cache hit.
[2025-05-31 23:07:01] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 78 constraints, problems are : Problem set: 0 solved, 192 unsolved in 2725 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 192/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 270 constraints, problems are : Problem set: 0 solved, 192 unsolved in 4969 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 7823ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 7828ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7986 ms. Remains : 50/50 places, 194/194 transitions.
[2025-05-31 23:07:08] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {12=1, 25=1, 87=1, 88=1, 133=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {12=1, 25=1, 93=1, 94=1, 141=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 36 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :[5, 5, 4, 8, 5, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[11, 285941, 54, 62, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:07:09] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11, 285941, 54, 62, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2725 resets) in 1362 ms. (733 steps per ms)
BEST_FIRST walk for 6000006 steps (1198 resets) in 2528 ms. (2372 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 285941, 54, 62, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:07:12] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:12] [INFO ] Invariant cache hit.
[2025-05-31 23:07:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:07:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:07:12] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:07:12] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Added 26 Read/Feed constraints in 15 ms returned sat
[2025-05-31 23:07:13] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 9 ms.
[2025-05-31 23:07:13] [INFO ] Added : 53 causal constraints over 11 iterations in 132 ms. Result :sat
Minimization took 49 ms.
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:07:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2025-05-31 23:07:13] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 10 ms.
[2025-05-31 23:07:13] [INFO ] Added : 46 causal constraints over 10 iterations in 111 ms. Result :sat
Minimization took 51 ms.
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:07:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:13] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 10 ms.
[2025-05-31 23:07:13] [INFO ] Added : 20 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 37 ms.
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:07:13] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:13] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 9 ms.
[2025-05-31 23:07:13] [INFO ] Added : 35 causal constraints over 7 iterations in 80 ms. Result :sat
Minimization took 50 ms.
[2025-05-31 23:07:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:07:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:07:14] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-31 23:07:14] [INFO ] Added : 24 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 43 ms.
[2025-05-31 23:07:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 23:07:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:07:14] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:14] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 9 ms.
[2025-05-31 23:07:14] [INFO ] Added : 47 causal constraints over 10 iterations in 117 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 285941, 54, 62, 14, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[18, 285941, 54, 62, 14, 18] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 50/50 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-05-31 23:07:44] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:44] [INFO ] Invariant cache hit.
[2025-05-31 23:07:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 23:07:44] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:44] [INFO ] Invariant cache hit.
[2025-05-31 23:07:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:07:44] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2025-05-31 23:07:44] [INFO ] Redundant transitions in 2 ms returned []
Running 192 sub problems to find dead transitions.
[2025-05-31 23:07:45] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:45] [INFO ] Invariant cache hit.
[2025-05-31 23:07:45] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 78 constraints, problems are : Problem set: 0 solved, 192 unsolved in 2687 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 192/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 270 constraints, problems are : Problem set: 0 solved, 192 unsolved in 4922 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 7727ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 7729ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7873 ms. Remains : 50/50 places, 194/194 transitions.
[2025-05-31 23:07:52] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {12=1, 25=1, 87=1, 88=1, 133=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {12=1, 25=1, 93=1, 94=1, 141=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :[4, 4, 5, 8, 3, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[18, 285941, 54, 62, 14, 18] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:07:52] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[18, 285941, 54, 62, 14, 18] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2761 resets) in 1350 ms. (740 steps per ms)
BEST_FIRST walk for 6000005 steps (1255 resets) in 2585 ms. (2320 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[18, 285941, 54, 62, 14, 18] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:07:56] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:07:56] [INFO ] Invariant cache hit.
[2025-05-31 23:07:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:56] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 23:07:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:07:56] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:07:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:56] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 8 ms.
[2025-05-31 23:07:56] [INFO ] Added : 54 causal constraints over 11 iterations in 122 ms. Result :sat
Minimization took 49 ms.
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:07:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2025-05-31 23:07:57] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 9 ms.
[2025-05-31 23:07:57] [INFO ] Added : 46 causal constraints over 10 iterations in 110 ms. Result :sat
Minimization took 45 ms.
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-05-31 23:07:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:07:57] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 9 ms.
[2025-05-31 23:07:57] [INFO ] Added : 20 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 35 ms.
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:57] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 8 ms.
[2025-05-31 23:07:57] [INFO ] Added : 35 causal constraints over 7 iterations in 74 ms. Result :sat
Minimization took 45 ms.
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 23:07:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:07:57] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 8 ms.
[2025-05-31 23:07:57] [INFO ] Added : 24 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 36 ms.
[2025-05-31 23:07:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:07:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:07:58] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:07:58] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2025-05-31 23:07:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:07:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:07:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 23:07:58] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-05-31 23:07:58] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:07:58] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 9 ms.
[2025-05-31 23:07:58] [INFO ] Added : 43 causal constraints over 9 iterations in 110 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[18, 285941, 54, 62, 14, 18] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[18, 285941, 54, 62, 14, 18] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 50/50 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-05-31 23:08:28] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:08:28] [INFO ] Invariant cache hit.
[2025-05-31 23:08:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-31 23:08:28] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:08:28] [INFO ] Invariant cache hit.
[2025-05-31 23:08:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:08:28] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2025-05-31 23:08:28] [INFO ] Redundant transitions in 1 ms returned []
Running 192 sub problems to find dead transitions.
[2025-05-31 23:08:28] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:08:28] [INFO ] Invariant cache hit.
[2025-05-31 23:08:28] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 78 constraints, problems are : Problem set: 0 solved, 192 unsolved in 2713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 192/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 270 constraints, problems are : Problem set: 0 solved, 192 unsolved in 4986 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 7809ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 7812ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7948 ms. Remains : 50/50 places, 194/194 transitions.
[2025-05-31 23:08:36] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {12=1, 25=1, 87=1, 88=1, 133=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {12=1, 25=1, 93=1, 94=1, 141=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :[5, 4, 5, 10, 3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[18, 285941, 54, 62, 14, 18] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (118 resets) in 1011 ms. (39 steps per ms) remains 6/6 properties
[2025-05-31 23:08:36] [INFO ] Flatten gal took : 76 ms
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
[2025-05-31 23:08:37] [INFO ] Flatten gal took : 55 ms
BEST_FIRST walk for 40003 steps (20 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
[2025-05-31 23:08:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2219370277738304386.gal : 17 ms
BEST_FIRST walk for 40003 steps (12 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
[2025-05-31 23:08:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5664421049696631575.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2219370277738304386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5664421049696631575.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (14 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5664421049696631575.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :9 after 30
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :30 after 64
BEST_FIRST walk for 40004 steps (17 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :64 after 13129
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :13129 after 853328
Interrupted probabilistic random walk after 226251 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :1 out of 6
Probabilistic random walk after 226251 steps, saw 169976 distinct states, run finished after 3004 ms. (steps per millisecond=75 ) properties seen :1
[2025-05-31 23:08:40] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:08:40] [INFO ] Invariant cache hit.
[2025-05-31 23:08:40] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 111/152 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/162 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 33/195 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/195 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 78 constraints, problems are : Problem set: 0 solved, 5 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 111/152 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 10/162 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 33/195 variables, 29/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/195 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 83 constraints, problems are : Problem set: 0 solved, 5 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :853328 after 7.26614e+06
Parikh walk visited 0 properties in 30008 ms.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 190
Applied a total of 2 rules in 22 ms. Remains 49 /50 variables (removed 1) and now considering 190/194 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 49/50 places, 190/194 transitions.
RANDOM walk for 40000 steps (120 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (14 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (16 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (19 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 314635 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 5
Probabilistic random walk after 314635 steps, saw 205760 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2025-05-31 23:09:13] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
// Phase 1: matrix 141 rows 49 cols
[2025-05-31 23:09:13] [INFO ] Computed 2 invariants in 1 ms
[2025-05-31 23:09:13] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 108/149 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/159 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 31/190 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 77 constraints, problems are : Problem set: 0 solved, 5 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 108/149 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 10/159 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 31/190 variables, 28/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 82 constraints, problems are : Problem set: 0 solved, 5 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 190/190 transitions.
Applied a total of 0 rules in 12 ms. Remains 49 /49 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 49/49 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 190/190 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2025-05-31 23:09:14] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:09:14] [INFO ] Invariant cache hit.
[2025-05-31 23:09:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 23:09:14] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:09:14] [INFO ] Invariant cache hit.
[2025-05-31 23:09:14] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:09:14] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2025-05-31 23:09:14] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2025-05-31 23:09:14] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:09:14] [INFO ] Invariant cache hit.
[2025-05-31 23:09:14] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :7.26614e+06 after 3.5404e+07
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 141/190 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 77 constraints, problems are : Problem set: 0 solved, 188 unsolved in 2613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 141/190 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 265 constraints, problems are : Problem set: 0 solved, 188 unsolved in 3513 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 6250ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 6253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6392 ms. Remains : 49/49 places, 190/190 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 49 transition count 141
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 49 place count 49 transition count 131
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 69 place count 39 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 38 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 37 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 37 transition count 126
Applied a total of 73 rules in 18 ms. Remains 37 /49 variables (removed 12) and now considering 126/190 (removed 64) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 126 rows 37 cols
[2025-05-31 23:09:20] [INFO ] Computed 2 invariants in 2 ms
[2025-05-31 23:09:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:09:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:09:20] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2025-05-31 23:09:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:09:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:09:20] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2025-05-31 23:09:20] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-05-31 23:09:20] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2025-05-31 23:09:20] [INFO ] Flatten gal took : 15 ms
[2025-05-31 23:09:20] [INFO ] Flatten gal took : 14 ms
[2025-05-31 23:09:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1967805292794508948.gal : 11 ms
[2025-05-31 23:09:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2257616030389557809.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1967805292794508948.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2257616030389557809.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2257616030389557809.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 175
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :175 after 6523
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :6523 after 3.2805e+06
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3.2805e+06 after 1.38047e+08
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.38047e+08 after 3.16959e+09
Detected timeout of ITS tools.
[2025-05-31 23:09:27] [INFO ] Flatten gal took : 23 ms
[2025-05-31 23:09:27] [INFO ] Applying decomposition
[2025-05-31 23:09:27] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12667532996101263246.txt' '-o' '/tmp/graph12667532996101263246.bin' '-w' '/tmp/graph12667532996101263246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12667532996101263246.bin' '-l' '-1' '-v' '-w' '/tmp/graph12667532996101263246.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:09:27] [INFO ] Decomposing Gal with order
[2025-05-31 23:09:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:09:27] [INFO ] Removed a total of 399 redundant transitions.
[2025-05-31 23:09:27] [INFO ] Flatten gal took : 60 ms
[2025-05-31 23:09:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 19 ms.
[2025-05-31 23:09:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6754631935656539937.gal : 12 ms
[2025-05-31 23:09:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3931613649054585329.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6754631935656539937.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3931613649054585329.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3931613649054585329.prop.
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :3.16959e+09 after 6.04214e+10
Detected timeout of ITS tools.
[2025-05-31 23:09:35] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:09:35] [INFO ] Applying decomposition
[2025-05-31 23:09:35] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11157930968724760195.txt' '-o' '/tmp/graph11157930968724760195.bin' '-w' '/tmp/graph11157930968724760195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11157930968724760195.bin' '-l' '-1' '-v' '-w' '/tmp/graph11157930968724760195.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:09:35] [INFO ] Decomposing Gal with order
[2025-05-31 23:09:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:09:35] [INFO ] Removed a total of 252 redundant transitions.
[2025-05-31 23:09:35] [INFO ] Flatten gal took : 16 ms
[2025-05-31 23:09:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2025-05-31 23:09:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10149745271804063444.gal : 2 ms
[2025-05-31 23:09:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6905941336425041942.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10149745271804063444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6905941336425041942.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6905941336425041942.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 63
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :63 after 47937
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :47937 after 550205
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :550205 after 5.70362e+06
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :5.70362e+06 after 3.19472e+07
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :3.19472e+07 after 1.12687e+08
Invariant property MIN4 does not hold.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.12687e+08 after 2.33766e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.33766e+08 after 4.49064e+08
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30426 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[18, 285941, 54, 62, 14, 18] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for DoubleLock-PT-p2s1-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:09:51] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
// Phase 1: matrix 145 rows 50 cols
[2025-05-31 23:09:51] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (25 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2025-05-31 23:09:51] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:09:51] [INFO ] Invariant cache hit.
[2025-05-31 23:09:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:09:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:09:51] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:09:51] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:09:51] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:09:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:09:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:09:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:09:51] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-05-31 23:09:51] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:09:51] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 9 ms.
[2025-05-31 23:09:51] [INFO ] Added : 18 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 190
Applied a total of 2 rules in 6 ms. Remains 49 /50 variables (removed 1) and now considering 190/194 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 49/50 places, 190/194 transitions.
[2025-05-31 23:09:51] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {5=2, 12=1, 24=1, 92=1, 93=1, 138=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {12=1, 24=1, 89=1, 90=1, 135=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
[2025-05-31 23:09:51] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
// Phase 1: matrix 141 rows 49 cols
[2025-05-31 23:09:51] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[12] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2821 resets) in 1259 ms. (793 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 399 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2025-05-31 23:09:53] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:09:53] [INFO ] Invariant cache hit.
[2025-05-31 23:09:53] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:09:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:09:53] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 23:09:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:09:53] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:09:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:09:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:09:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:09:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:09:53] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:09:53] [INFO ] Computed and/alt/rep : 60/382/60 causal constraints (skipped 79 transitions) in 9 ms.
[2025-05-31 23:09:53] [INFO ] Added : 32 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 49/49 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 190/190 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2025-05-31 23:09:53] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:09:53] [INFO ] Invariant cache hit.
[2025-05-31 23:09:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-31 23:09:53] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:09:53] [INFO ] Invariant cache hit.
[2025-05-31 23:09:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:09:53] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2025-05-31 23:09:53] [INFO ] Redundant transitions in 0 ms returned []
Running 188 sub problems to find dead transitions.
[2025-05-31 23:09:53] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:09:53] [INFO ] Invariant cache hit.
[2025-05-31 23:09:53] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 141/190 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 77 constraints, problems are : Problem set: 0 solved, 188 unsolved in 2758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 141/190 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 265 constraints, problems are : Problem set: 0 solved, 188 unsolved in 3581 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 6444ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 6446ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6591 ms. Remains : 49/49 places, 190/190 transitions.
[2025-05-31 23:09:59] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {5=2, 12=1, 24=1, 92=1, 93=1, 138=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {12=1, 24=1, 89=1, 90=1, 135=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 36 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
[2025-05-31 23:10:00] [INFO ] Flatten gal took : 15 ms
RANDOM walk for 40000 steps (119 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
[2025-05-31 23:10:00] [INFO ] Flatten gal took : 24 ms
[2025-05-31 23:10:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8366248950752365309.gal : 2 ms
BEST_FIRST walk for 40002 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2025-05-31 23:10:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1111021255688305934.prop : 13 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8366248950752365309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1111021255688305934.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1111021255688305934.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 862
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :862 after 15024
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15024 after 134915
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :134915 after 451967
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :451967 after 1.08274e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.08274e+06 after 2.33931e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.33931e+06 after 4.84766e+06
Interrupted probabilistic random walk after 1909228 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :0 out of 1
Probabilistic random walk after 1909228 steps, saw 1220339 distinct states, run finished after 3001 ms. (steps per millisecond=636 ) properties seen :0
[2025-05-31 23:10:03] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:10:03] [INFO ] Invariant cache hit.
[2025-05-31 23:10:03] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/134 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 13/147 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 43/190 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/134 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/147 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/190 variables, 37/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 190/190 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 49/49 places, 190/190 transitions.
RANDOM walk for 40000 steps (110 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.84766e+06 after 9.85937e+06
Interrupted probabilistic random walk after 2158021 steps, run timeout after 3001 ms. (steps per millisecond=719 ) properties seen :0 out of 1
Probabilistic random walk after 2158021 steps, saw 1378802 distinct states, run finished after 3001 ms. (steps per millisecond=719 ) properties seen :0
[2025-05-31 23:10:06] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:10:06] [INFO ] Invariant cache hit.
[2025-05-31 23:10:06] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/134 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 13/147 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 43/190 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/134 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/147 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/190 variables, 37/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2025-05-31 23:10:06] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:10:06] [INFO ] Invariant cache hit.
[2025-05-31 23:10:06] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 23:10:06] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:10:06] [INFO ] Invariant cache hit.
[2025-05-31 23:10:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:10:06] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2025-05-31 23:10:06] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2025-05-31 23:10:06] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
[2025-05-31 23:10:06] [INFO ] Invariant cache hit.
[2025-05-31 23:10:06] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 141/190 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 77 constraints, problems are : Problem set: 0 solved, 188 unsolved in 2923 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 141/190 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9.85937e+06 after 1.9878e+07
After SMT solving in domain Int declared 190/190 variables, and 265 constraints, problems are : Problem set: 0 solved, 188 unsolved in 3644 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 6721ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 6725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6880 ms. Remains : 49/49 places, 190/190 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 49 transition count 141
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 49 place count 49 transition count 131
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 69 place count 39 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 37 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 36 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 36 transition count 125
Applied a total of 75 rules in 7 ms. Remains 36 /49 variables (removed 13) and now considering 125/190 (removed 65) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 36 cols
[2025-05-31 23:10:13] [INFO ] Computed 2 invariants in 2 ms
[2025-05-31 23:10:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:10:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:10:13] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 23:10:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:10:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:10:13] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 23:10:13] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:10:13] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:10:13] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:10:13] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:10:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2662696277140049388.gal : 1 ms
[2025-05-31 23:10:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6428271413345615223.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2662696277140049388.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6428271413345615223.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6428271413345615223.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 175
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :175 after 3047
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3047 after 172196
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :172196 after 1.2704e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.2704e+06 after 6.33955e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.33955e+06 after 2.81134e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.81134e+07 after 1.17572e+08
Detected timeout of ITS tools.
[2025-05-31 23:10:28] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:10:28] [INFO ] Applying decomposition
[2025-05-31 23:10:28] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16156790944687146957.txt' '-o' '/tmp/graph16156790944687146957.bin' '-w' '/tmp/graph16156790944687146957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16156790944687146957.bin' '-l' '-1' '-v' '-w' '/tmp/graph16156790944687146957.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:10:28] [INFO ] Decomposing Gal with order
[2025-05-31 23:10:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:10:28] [INFO ] Removed a total of 252 redundant transitions.
[2025-05-31 23:10:28] [INFO ] Flatten gal took : 12 ms
[2025-05-31 23:10:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2025-05-31 23:10:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2732395898743619943.gal : 1 ms
[2025-05-31 23:10:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4935745203471142032.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2732395898743619943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4935745203471142032.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4935745203471142032.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 63
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30357 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 23:10:43] [INFO ] Flatten gal took : 15 ms
[2025-05-31 23:10:43] [INFO ] Applying decomposition
[2025-05-31 23:10:43] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5291844811292610402.txt' '-o' '/tmp/graph5291844811292610402.bin' '-w' '/tmp/graph5291844811292610402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5291844811292610402.bin' '-l' '-1' '-v' '-w' '/tmp/graph5291844811292610402.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:10:43] [INFO ] Decomposing Gal with order
[2025-05-31 23:10:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:10:43] [INFO ] Removed a total of 397 redundant transitions.
[2025-05-31 23:10:43] [INFO ] Flatten gal took : 23 ms
[2025-05-31 23:10:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2025-05-31 23:10:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1365424038122171307.gal : 2 ms
[2025-05-31 23:10:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9254087213827437022.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1365424038122171307.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9254087213827437022.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9254087213827437022.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s1-UpperBounds-04 in 103091 ms.
Starting property specific reduction for DoubleLock-PT-p2s1-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:11:34] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
// Phase 1: matrix 145 rows 50 cols
[2025-05-31 23:11:34] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (24 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2025-05-31 23:11:34] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:11:34] [INFO ] Invariant cache hit.
[2025-05-31 23:11:34] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:11:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:11:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:11:34] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:11:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:11:34] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2025-05-31 23:11:34] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 9 ms.
[2025-05-31 23:11:34] [INFO ] Added : 42 causal constraints over 9 iterations in 103 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[+inf]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 49 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 49 transition count 188
Applied a total of 4 rules in 6 ms. Remains 49 /50 variables (removed 1) and now considering 188/194 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 49/50 places, 188/194 transitions.
[2025-05-31 23:11:34] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[10]
Current structural bounds on expressions (after cover walk) : Max Seen:[64] Max Struct:[+inf]
[2025-05-31 23:11:34] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
// Phase 1: matrix 139 rows 49 cols
[2025-05-31 23:11:34] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[64] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1446 ms. (691 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 441 ms. (2262 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1506] Max Struct:[+inf]
[2025-05-31 23:11:36] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:36] [INFO ] Invariant cache hit.
[2025-05-31 23:11:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:36] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 23:11:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:36] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:11:36] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:11:36] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:11:36] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2025-05-31 23:11:36] [INFO ] Added : 12 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1506] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1506] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:11:38] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:38] [INFO ] Invariant cache hit.
[2025-05-31 23:11:38] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 23:11:38] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:38] [INFO ] Invariant cache hit.
[2025-05-31 23:11:38] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:11:38] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2025-05-31 23:11:38] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:11:38] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:38] [INFO ] Invariant cache hit.
[2025-05-31 23:11:38] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4840 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6780ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6933 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:11:44] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[1506] Max Struct:[+inf]
[2025-05-31 23:11:45] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1506] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1380 ms. (724 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 445 ms. (2242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1668] Max Struct:[+inf]
[2025-05-31 23:11:46] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:46] [INFO ] Invariant cache hit.
[2025-05-31 23:11:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:11:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:46] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:11:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:11:46] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:11:47] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2025-05-31 23:11:47] [INFO ] Added : 12 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1668] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1668] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:11:48] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:48] [INFO ] Invariant cache hit.
[2025-05-31 23:11:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-31 23:11:48] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:48] [INFO ] Invariant cache hit.
[2025-05-31 23:11:48] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:11:48] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2025-05-31 23:11:48] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:11:48] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:48] [INFO ] Invariant cache hit.
[2025-05-31 23:11:48] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1766 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4681 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6532ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6669 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:11:55] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2025-05-31 23:11:55] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1371 ms. (728 steps per ms)
FORMULA DoubleLock-PT-p2s1-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-31 23:11:56] [INFO ] Flatten gal took : 11 ms
[2025-05-31 23:11:56] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:11:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16937433831488428005.gal : 7 ms
[2025-05-31 23:11:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11736598922717180188.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16937433831488428005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11736598922717180188.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DoubleLock-PT-p2s1-UpperBounds-06 in 22672 ms.
Starting property specific reduction for DoubleLock-PT-p2s1-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:11:56] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
// Phase 1: matrix 145 rows 50 cols
[2025-05-31 23:11:56] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (25 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[+inf]
[2025-05-31 23:11:56] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:11:56] [INFO ] Invariant cache hit.
[2025-05-31 23:11:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2025-05-31 23:11:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 23:11:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:11:56] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2025-05-31 23:11:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:11:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:11:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:11:56] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 8 ms.
[2025-05-31 23:11:56] [INFO ] Added : 16 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[+inf]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 49 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 49 transition count 188
Applied a total of 4 rules in 4 ms. Remains 49 /50 variables (removed 1) and now considering 188/194 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 49/50 places, 188/194 transitions.
[2025-05-31 23:11:57] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[11] Max Struct:[+inf]
[2025-05-31 23:11:57] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
// Phase 1: matrix 139 rows 49 cols
[2025-05-31 23:11:57] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1398 ms. (714 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 436 ms. (2288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1403] Max Struct:[+inf]
[2025-05-31 23:11:58] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:58] [INFO ] Invariant cache hit.
[2025-05-31 23:11:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:11:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:59] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:11:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:11:59] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:11:59] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 9 ms.
[2025-05-31 23:11:59] [INFO ] Added : 22 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1403] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1403] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 7 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:11:59] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:59] [INFO ] Invariant cache hit.
[2025-05-31 23:11:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-31 23:11:59] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:59] [INFO ] Invariant cache hit.
[2025-05-31 23:11:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:11:59] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2025-05-31 23:11:59] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:11:59] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:11:59] [INFO ] Invariant cache hit.
[2025-05-31 23:11:59] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1875 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4820 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6802ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6978 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:12:06] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[1403] Max Struct:[+inf]
[2025-05-31 23:12:06] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1403] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1385 ms. (721 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 456 ms. (2188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1492] Max Struct:[+inf]
[2025-05-31 23:12:08] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:08] [INFO ] Invariant cache hit.
[2025-05-31 23:12:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:12:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:12:08] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:12:08] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:12:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-05-31 23:12:08] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:12:08] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2025-05-31 23:12:08] [INFO ] Added : 27 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1492] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1492] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 9 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:12:08] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:08] [INFO ] Invariant cache hit.
[2025-05-31 23:12:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 23:12:08] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:08] [INFO ] Invariant cache hit.
[2025-05-31 23:12:08] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:12:08] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2025-05-31 23:12:08] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:12:08] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:08] [INFO ] Invariant cache hit.
[2025-05-31 23:12:08] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1867 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4844 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6800ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6803ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6947 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:12:15] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[1492] Max Struct:[+inf]
[2025-05-31 23:12:15] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1492] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1406 ms. (710 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 435 ms. (2293 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1556] Max Struct:[+inf]
[2025-05-31 23:12:17] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:17] [INFO ] Invariant cache hit.
[2025-05-31 23:12:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:17] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 23:12:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:12:17] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:12:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:17] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 23:12:17] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:12:17] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 9 ms.
[2025-05-31 23:12:17] [INFO ] Added : 27 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1556] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1556] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:12:17] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:17] [INFO ] Invariant cache hit.
[2025-05-31 23:12:17] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-31 23:12:17] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:17] [INFO ] Invariant cache hit.
[2025-05-31 23:12:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:12:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2025-05-31 23:12:17] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:12:17] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:17] [INFO ] Invariant cache hit.
[2025-05-31 23:12:17] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1846 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4843 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6779ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6783ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6921 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:12:24] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[1556] Max Struct:[+inf]
[2025-05-31 23:12:24] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1556] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1421 ms. (703 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 438 ms. (2277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1556] Max Struct:[+inf]
[2025-05-31 23:12:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:26] [INFO ] Invariant cache hit.
[2025-05-31 23:12:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:12:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 23:12:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:12:26] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:12:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:12:26] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:12:26] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 8 ms.
[2025-05-31 23:12:26] [INFO ] Added : 27 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1556] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1556] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:12:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:26] [INFO ] Invariant cache hit.
[2025-05-31 23:12:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-31 23:12:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:26] [INFO ] Invariant cache hit.
[2025-05-31 23:12:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:12:26] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2025-05-31 23:12:26] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:12:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:26] [INFO ] Invariant cache hit.
[2025-05-31 23:12:26] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4828 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6799ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6801ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6948 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:12:33] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[1556] Max Struct:[+inf]
[2025-05-31 23:12:33] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:12:33] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:12:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality658402384743299981.gal : 1 ms
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
[2025-05-31 23:12:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14897600520845689343.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality658402384743299981.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14897600520845689343.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality14897600520845689343.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 13129
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13129 after 853328
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :853328 after 7.26614e+06
Interrupted probabilistic random walk after 1936790 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :0 out of 1
Probabilistic random walk after 1936790 steps, saw 1236338 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
[2025-05-31 23:12:36] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:36] [INFO ] Invariant cache hit.
[2025-05-31 23:12:36] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/129 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 22/151 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/188 variables, 34/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/129 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.26614e+06 after 3.5404e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/151 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/188 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 49/49 places, 188/188 transitions.
RANDOM walk for 40000 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2193851 steps, run timeout after 3001 ms. (steps per millisecond=731 ) properties seen :0 out of 1
Probabilistic random walk after 2193851 steps, saw 1399932 distinct states, run finished after 3001 ms. (steps per millisecond=731 ) properties seen :0
[2025-05-31 23:12:39] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:39] [INFO ] Invariant cache hit.
[2025-05-31 23:12:39] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/129 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 22/151 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/188 variables, 34/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/129 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/151 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/188 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:12:40] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:40] [INFO ] Invariant cache hit.
[2025-05-31 23:12:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 23:12:40] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:40] [INFO ] Invariant cache hit.
[2025-05-31 23:12:40] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:12:40] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2025-05-31 23:12:40] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:12:40] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:12:40] [INFO ] Invariant cache hit.
[2025-05-31 23:12:40] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1820 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.5404e+07 after 1.52093e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4841 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6748ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6750ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6883 ms. Remains : 49/49 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 49 transition count 139
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 49 place count 49 transition count 128
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 71 place count 38 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 36 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 35 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 35 transition count 122
Applied a total of 77 rules in 13 ms. Remains 35 /49 variables (removed 14) and now considering 122/188 (removed 66) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 122 rows 35 cols
[2025-05-31 23:12:46] [INFO ] Computed 3 invariants in 1 ms
[2025-05-31 23:12:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:46] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 23:12:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:47] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 23:12:47] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:12:47] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:12:47] [INFO ] Flatten gal took : 5 ms
[2025-05-31 23:12:47] [INFO ] Flatten gal took : 5 ms
[2025-05-31 23:12:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12213202870924138630.gal : 1 ms
[2025-05-31 23:12:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8172793118265952271.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12213202870924138630.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8172793118265952271.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8172793118265952271.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 175
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :175 after 4653
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4653 after 191543
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :191543 after 1.30588e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.30588e+06 after 6.4495e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.4495e+06 after 2.82981e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.82981e+07 after 1.18042e+08
Detected timeout of ITS tools.
[2025-05-31 23:13:02] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:13:02] [INFO ] Applying decomposition
[2025-05-31 23:13:02] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6813054388252040191.txt' '-o' '/tmp/graph6813054388252040191.bin' '-w' '/tmp/graph6813054388252040191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6813054388252040191.bin' '-l' '-1' '-v' '-w' '/tmp/graph6813054388252040191.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:13:02] [INFO ] Decomposing Gal with order
[2025-05-31 23:13:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:13:02] [INFO ] Removed a total of 249 redundant transitions.
[2025-05-31 23:13:02] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:13:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2025-05-31 23:13:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3379229113465461047.gal : 1 ms
[2025-05-31 23:13:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11598267438704079216.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3379229113465461047.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11598267438704079216.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11598267438704079216.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 63
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30252 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 23:13:17] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:13:17] [INFO ] Applying decomposition
[2025-05-31 23:13:17] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6453578291851969545.txt' '-o' '/tmp/graph6453578291851969545.bin' '-w' '/tmp/graph6453578291851969545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6453578291851969545.bin' '-l' '-1' '-v' '-w' '/tmp/graph6453578291851969545.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:13:17] [INFO ] Decomposing Gal with order
[2025-05-31 23:13:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:13:17] [INFO ] Removed a total of 394 redundant transitions.
[2025-05-31 23:13:17] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:13:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2025-05-31 23:13:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8387765066290434633.gal : 1 ms
[2025-05-31 23:13:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1806584779589657094.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8387765066290434633.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1806584779589657094.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1806584779589657094.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1556] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s1-UpperBounds-11 in 130576 ms.
Starting property specific reduction for DoubleLock-PT-p2s1-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:14:07] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
// Phase 1: matrix 145 rows 50 cols
[2025-05-31 23:14:07] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (33 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13] Max Struct:[+inf]
[2025-05-31 23:14:07] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:14:07] [INFO ] Invariant cache hit.
[2025-05-31 23:14:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:14:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:14:07] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 23:14:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:14:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:14:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:14:07] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 23:14:07] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:14:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2025-05-31 23:14:07] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 8 ms.
[2025-05-31 23:14:07] [INFO ] Added : 39 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13] Max Struct:[+inf]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 192
Applied a total of 2 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 192/194 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/50 places, 192/194 transitions.
[2025-05-31 23:14:07] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 24=1, 94=1, 95=1, 141=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 24=1, 88=1, 89=1, 136=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2025-05-31 23:14:07] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
// Phase 1: matrix 143 rows 50 cols
[2025-05-31 23:14:07] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1497 ms. (667 steps per ms)
FORMULA DoubleLock-PT-p2s1-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-31 23:14:09] [INFO ] Flatten gal took : 9 ms
[2025-05-31 23:14:09] [INFO ] Flatten gal took : 6 ms
[2025-05-31 23:14:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4588793955153884319.gal : 2 ms
[2025-05-31 23:14:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13841433719641030971.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4588793955153884319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13841433719641030971.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DoubleLock-PT-p2s1-UpperBounds-12 in 1973 ms.
Starting property specific reduction for DoubleLock-PT-p2s1-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:14:09] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
// Phase 1: matrix 145 rows 50 cols
[2025-05-31 23:14:09] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (28 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[+inf]
[2025-05-31 23:14:09] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:14:09] [INFO ] Invariant cache hit.
[2025-05-31 23:14:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:14:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:14:09] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 23:14:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:14:09] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:14:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:14:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:14:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:14:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 23:14:09] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:14:09] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 9 ms.
[2025-05-31 23:14:09] [INFO ] Added : 17 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[+inf]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 49 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 49 transition count 188
Applied a total of 4 rules in 4 ms. Remains 49 /50 variables (removed 1) and now considering 188/194 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 49/50 places, 188/194 transitions.
[2025-05-31 23:14:09] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[10] Max Struct:[+inf]
[2025-05-31 23:14:09] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
// Phase 1: matrix 139 rows 49 cols
[2025-05-31 23:14:09] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1454 ms. (687 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 402 ms. (2481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2025-05-31 23:14:11] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:11] [INFO ] Invariant cache hit.
[2025-05-31 23:14:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:14:11] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 23:14:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:14:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:14:11] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:14:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:14:11] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:14:11] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 9 ms.
[2025-05-31 23:14:11] [INFO ] Added : 36 causal constraints over 8 iterations in 86 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:14:11] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:11] [INFO ] Invariant cache hit.
[2025-05-31 23:14:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-31 23:14:11] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:11] [INFO ] Invariant cache hit.
[2025-05-31 23:14:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:14:12] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2025-05-31 23:14:12] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:14:12] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:12] [INFO ] Invariant cache hit.
[2025-05-31 23:14:12] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1792 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4696 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6586ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6590ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6754 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:14:18] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2025-05-31 23:14:18] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1425 ms. (701 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 397 ms. (2512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2025-05-31 23:14:20] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:20] [INFO ] Invariant cache hit.
[2025-05-31 23:14:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:14:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 23:14:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:14:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:14:20] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:14:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:14:20] [INFO ] [Nat]Added 26 Read/Feed constraints in 11 ms returned sat
[2025-05-31 23:14:20] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 9 ms.
[2025-05-31 23:14:20] [INFO ] Added : 36 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:14:20] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:20] [INFO ] Invariant cache hit.
[2025-05-31 23:14:20] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-31 23:14:20] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:20] [INFO ] Invariant cache hit.
[2025-05-31 23:14:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:14:21] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2025-05-31 23:14:21] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:14:21] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:21] [INFO ] Invariant cache hit.
[2025-05-31 23:14:21] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1794 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4672 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6558ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6560ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6702 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:14:27] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2025-05-31 23:14:27] [INFO ] Flatten gal took : 12 ms
[2025-05-31 23:14:27] [INFO ] Flatten gal took : 9 ms
[2025-05-31 23:14:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7135130714494490353.gal : 1 ms
[2025-05-31 23:14:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12481957781625192499.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7135130714494490353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12481957781625192499.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality12481957781625192499.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 13129
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13129 after 853328
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :853328 after 7.26614e+06
Interrupted probabilistic random walk after 2078988 steps, run timeout after 3001 ms. (steps per millisecond=692 ) properties seen :0 out of 1
Probabilistic random walk after 2078988 steps, saw 1328167 distinct states, run finished after 3003 ms. (steps per millisecond=692 ) properties seen :0
[2025-05-31 23:14:30] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:30] [INFO ] Invariant cache hit.
[2025-05-31 23:14:30] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 17/149 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/188 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.26614e+06 after 3.5404e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/149 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/188 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/49 places, 188/188 transitions.
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1685585 steps, run timeout after 3001 ms. (steps per millisecond=561 ) properties seen :0 out of 1
Probabilistic random walk after 1685585 steps, saw 1072995 distinct states, run finished after 3001 ms. (steps per millisecond=561 ) properties seen :0
[2025-05-31 23:14:33] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:33] [INFO ] Invariant cache hit.
[2025-05-31 23:14:33] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 17/149 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/188 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/132 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/149 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/188 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:14:34] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:34] [INFO ] Invariant cache hit.
[2025-05-31 23:14:34] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-31 23:14:34] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:34] [INFO ] Invariant cache hit.
[2025-05-31 23:14:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:14:34] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2025-05-31 23:14:34] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:14:34] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:14:34] [INFO ] Invariant cache hit.
[2025-05-31 23:14:34] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1792 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.5404e+07 after 1.52093e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4952 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6876ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6879ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7023 ms. Remains : 49/49 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 49 transition count 139
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 49 place count 49 transition count 129
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 69 place count 39 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 37 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 36 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 36 transition count 123
Applied a total of 75 rules in 10 ms. Remains 36 /49 variables (removed 13) and now considering 123/188 (removed 65) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 36 cols
[2025-05-31 23:14:41] [INFO ] Computed 3 invariants in 1 ms
[2025-05-31 23:14:41] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-05-31 23:14:41] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 23:14:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-05-31 23:14:41] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 23:14:41] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:14:41] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:14:41] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:14:41] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:14:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12205185983669607203.gal : 1 ms
[2025-05-31 23:14:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9049442713636986214.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12205185983669607203.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9049442713636986214.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9049442713636986214.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 175
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :175 after 3047
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3047 after 172196
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :172196 after 1.2704e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.2704e+06 after 6.33955e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.33955e+06 after 2.81134e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.81134e+07 after 1.17572e+08
Detected timeout of ITS tools.
[2025-05-31 23:14:56] [INFO ] Flatten gal took : 3 ms
[2025-05-31 23:14:56] [INFO ] Applying decomposition
[2025-05-31 23:14:56] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17986246517184284628.txt' '-o' '/tmp/graph17986246517184284628.bin' '-w' '/tmp/graph17986246517184284628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17986246517184284628.bin' '-l' '-1' '-v' '-w' '/tmp/graph17986246517184284628.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:14:56] [INFO ] Decomposing Gal with order
[2025-05-31 23:14:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:14:56] [INFO ] Removed a total of 249 redundant transitions.
[2025-05-31 23:14:56] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:14:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2025-05-31 23:14:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3523627473752331503.gal : 2 ms
[2025-05-31 23:14:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5922446862145094080.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3523627473752331503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5922446862145094080.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5922446862145094080.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 63
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :63 after 42176
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42176 after 2.60989e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30220 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 23:15:11] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:15:11] [INFO ] Applying decomposition
[2025-05-31 23:15:11] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17401162447426746455.txt' '-o' '/tmp/graph17401162447426746455.bin' '-w' '/tmp/graph17401162447426746455.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17401162447426746455.bin' '-l' '-1' '-v' '-w' '/tmp/graph17401162447426746455.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:15:11] [INFO ] Decomposing Gal with order
[2025-05-31 23:15:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:15:11] [INFO ] Removed a total of 394 redundant transitions.
[2025-05-31 23:15:11] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:15:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2025-05-31 23:15:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15376364017180357768.gal : 1 ms
[2025-05-31 23:15:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9356853903099839190.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15376364017180357768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9356853903099839190.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9356853903099839190.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[15] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s1-UpperBounds-13 in 112205 ms.
Starting property specific reduction for DoubleLock-PT-p2s1-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 23:16:01] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
// Phase 1: matrix 145 rows 50 cols
[2025-05-31 23:16:01] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (30 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[+inf]
[2025-05-31 23:16:01] [INFO ] Flow matrix only has 145 transitions (discarded 49 similar events)
[2025-05-31 23:16:01] [INFO ] Invariant cache hit.
[2025-05-31 23:16:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:16:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:16:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 23:16:01] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:16:01] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2025-05-31 23:16:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:16:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:16:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:16:01] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-05-31 23:16:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:16:01] [INFO ] Computed and/alt/rep : 62/426/62 causal constraints (skipped 81 transitions) in 7 ms.
[2025-05-31 23:16:01] [INFO ] Added : 31 causal constraints over 7 iterations in 82 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[+inf]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 194/194 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 49 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 49 transition count 188
Applied a total of 4 rules in 3 ms. Remains 49 /50 variables (removed 1) and now considering 188/194 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 49/50 places, 188/194 transitions.
[2025-05-31 23:16:01] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[10] Max Struct:[+inf]
[2025-05-31 23:16:01] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
// Phase 1: matrix 139 rows 49 cols
[2025-05-31 23:16:01] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1467 ms. (681 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 395 ms. (2525 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[+inf]
[2025-05-31 23:16:03] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:03] [INFO ] Invariant cache hit.
[2025-05-31 23:16:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:16:03] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 23:16:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:16:03] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:16:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:16:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:16:03] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-05-31 23:16:03] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2025-05-31 23:16:03] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 9 ms.
[2025-05-31 23:16:04] [INFO ] Added : 26 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:16:04] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:04] [INFO ] Invariant cache hit.
[2025-05-31 23:16:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-31 23:16:04] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:04] [INFO ] Invariant cache hit.
[2025-05-31 23:16:04] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:16:04] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2025-05-31 23:16:04] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:16:04] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:04] [INFO ] Invariant cache hit.
[2025-05-31 23:16:04] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4717 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6695ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6697ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6865 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:16:11] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
[2025-05-31 23:16:11] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1392 ms. (717 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 395 ms. (2525 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[+inf]
[2025-05-31 23:16:12] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:12] [INFO ] Invariant cache hit.
[2025-05-31 23:16:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:16:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 23:16:12] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:16:12] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:16:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:16:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-05-31 23:16:12] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-05-31 23:16:12] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2025-05-31 23:16:13] [INFO ] Computed and/alt/rep : 59/378/59 causal constraints (skipped 78 transitions) in 9 ms.
[2025-05-31 23:16:13] [INFO ] Added : 26 causal constraints over 6 iterations in 74 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:16:13] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:13] [INFO ] Invariant cache hit.
[2025-05-31 23:16:13] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-31 23:16:13] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:13] [INFO ] Invariant cache hit.
[2025-05-31 23:16:13] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:16:13] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2025-05-31 23:16:13] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:16:13] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:13] [INFO ] Invariant cache hit.
[2025-05-31 23:16:13] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1824 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4924 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6837ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6981 ms. Remains : 49/49 places, 188/188 transitions.
[2025-05-31 23:16:20] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
Found an invariant !
This invariant on transitions {11=1, 23=1, 84=1, 85=1, 132=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 87=1, 88=1, 134=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
[2025-05-31 23:16:20] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:16:20] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:16:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality761982178782272947.gal : 1 ms
[2025-05-31 23:16:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15344183663944767846.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality761982178782272947.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15344183663944767846.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40008 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality15344183663944767846.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 13129
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13129 after 853328
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :853328 after 7.26614e+06
Interrupted probabilistic random walk after 2223701 steps, run timeout after 3001 ms. (steps per millisecond=740 ) properties seen :0 out of 1
Probabilistic random walk after 2223701 steps, saw 1417843 distinct states, run finished after 3001 ms. (steps per millisecond=740 ) properties seen :0
[2025-05-31 23:16:23] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:23] [INFO ] Invariant cache hit.
[2025-05-31 23:16:23] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/133 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 17/150 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/188 variables, 33/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/133 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/150 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 38/188 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.26614e+06 after 3.5404e+07
RANDOM walk for 40000 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1905698 steps, run timeout after 3001 ms. (steps per millisecond=635 ) properties seen :0 out of 1
Probabilistic random walk after 1905698 steps, saw 1217057 distinct states, run finished after 3001 ms. (steps per millisecond=635 ) properties seen :0
[2025-05-31 23:16:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:26] [INFO ] Invariant cache hit.
[2025-05-31 23:16:26] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/133 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 17/150 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/188 variables, 33/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/133 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/150 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 38/188 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-05-31 23:16:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:26] [INFO ] Invariant cache hit.
[2025-05-31 23:16:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-31 23:16:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:26] [INFO ] Invariant cache hit.
[2025-05-31 23:16:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-31 23:16:26] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2025-05-31 23:16:26] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-31 23:16:26] [INFO ] Flow matrix only has 139 transitions (discarded 49 similar events)
[2025-05-31 23:16:26] [INFO ] Invariant cache hit.
[2025-05-31 23:16:26] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 186 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 139/188 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 186/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.5404e+07 after 1.52093e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4715 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6693ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6695ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6830 ms. Remains : 49/49 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 49 transition count 139
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 49 place count 49 transition count 128
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 71 place count 38 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 37 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 36 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 36 transition count 123
Applied a total of 75 rules in 8 ms. Remains 36 /49 variables (removed 13) and now considering 123/188 (removed 65) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 36 cols
[2025-05-31 23:16:33] [INFO ] Computed 3 invariants in 2 ms
[2025-05-31 23:16:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:16:33] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 23:16:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-05-31 23:16:33] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 23:16:33] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:16:33] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:16:33] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:16:33] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:16:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3779552572702356478.gal : 2 ms
[2025-05-31 23:16:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality551438569912413730.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3779552572702356478.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality551438569912413730.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality551438569912413730.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 175
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :175 after 4653
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4653 after 191543
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :191543 after 1.30588e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.30588e+06 after 6.4495e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.4495e+06 after 2.82981e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.82981e+07 after 1.18042e+08
Detected timeout of ITS tools.
[2025-05-31 23:16:48] [INFO ] Flatten gal took : 7 ms
[2025-05-31 23:16:48] [INFO ] Applying decomposition
[2025-05-31 23:16:48] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13226156818362752061.txt' '-o' '/tmp/graph13226156818362752061.bin' '-w' '/tmp/graph13226156818362752061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13226156818362752061.bin' '-l' '-1' '-v' '-w' '/tmp/graph13226156818362752061.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:16:48] [INFO ] Decomposing Gal with order
[2025-05-31 23:16:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:16:48] [INFO ] Removed a total of 247 redundant transitions.
[2025-05-31 23:16:48] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:16:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2025-05-31 23:16:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4380645440205362277.gal : 1 ms
[2025-05-31 23:16:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7303160363810299445.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4380645440205362277.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7303160363810299445.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7303160363810299445.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 126
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30286 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 23:17:03] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:17:03] [INFO ] Applying decomposition
[2025-05-31 23:17:03] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5482288154994777407.txt' '-o' '/tmp/graph5482288154994777407.bin' '-w' '/tmp/graph5482288154994777407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5482288154994777407.bin' '-l' '-1' '-v' '-w' '/tmp/graph5482288154994777407.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:17:03] [INFO ] Decomposing Gal with order
[2025-05-31 23:17:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:17:03] [INFO ] Removed a total of 394 redundant transitions.
[2025-05-31 23:17:03] [INFO ] Flatten gal took : 10 ms
[2025-05-31 23:17:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2025-05-31 23:17:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13045766734930131498.gal : 1 ms
[2025-05-31 23:17:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6105443324192881532.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13045766734930131498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6105443324192881532.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6105443324192881532.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[16] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s1-UpperBounds-15 in 112460 ms.
[2025-05-31 23:17:54] [INFO ] Flatten gal took : 6 ms
[2025-05-31 23:17:54] [INFO ] Applying decomposition
[2025-05-31 23:17:54] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11150941140491999017.txt' '-o' '/tmp/graph11150941140491999017.bin' '-w' '/tmp/graph11150941140491999017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11150941140491999017.bin' '-l' '-1' '-v' '-w' '/tmp/graph11150941140491999017.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:17:54] [INFO ] Decomposing Gal with order
[2025-05-31 23:17:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:17:54] [INFO ] Removed a total of 399 redundant transitions.
[2025-05-31 23:17:54] [INFO ] Flatten gal took : 15 ms
[2025-05-31 23:17:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2025-05-31 23:17:54] [INFO ] Time to serialize gal into /tmp/UpperBounds8719480020721891403.gal : 1 ms
[2025-05-31 23:17:54] [INFO ] Time to serialize properties into /tmp/UpperBounds6586520280829706569.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8719480020721891403.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6586520280829706569.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds6586520280829706569.prop.
Detected timeout of ITS tools.
[2025-05-31 23:41:40] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:41:40] [INFO ] Time to serialize gal into /tmp/UpperBounds11622322839874745264.gal : 1 ms
[2025-05-31 23:41:40] [INFO ] Time to serialize properties into /tmp/UpperBounds2528066946719963380.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11622322839874745264.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2528066946719963380.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds2528066946719963380.prop.
ITS-tools command line returned an error code 137
[2025-06-01 00:00:28] [INFO ] Flatten gal took : 10 ms
[2025-06-01 00:00:28] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-01 00:00:28] [INFO ] Transformed 50 places.
[2025-06-01 00:00:28] [INFO ] Transformed 194 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 00:00:28] [INFO ] Time to serialize gal into /tmp/UpperBounds4929132676800733940.gal : 1 ms
[2025-06-01 00:00:28] [INFO ] Time to serialize properties into /tmp/UpperBounds12687180614293455572.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4929132676800733940.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12687180614293455572.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12687180614293455572.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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="DoubleLock-PT-p2s1"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is DoubleLock-PT-p2s1, 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 r083-tall-174860079700069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s1.tgz
mv DoubleLock-PT-p2s1 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 ;