About the Execution of 2024-gold for PolyORBLF-COL-S02J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15694.730 | 2738663.00 | 3100767.00 | 9284.40 | 1 ? 10 2 1 1 1 0 1 1 1 2 1 1 10 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266000039.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 PolyORBLF-COL-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266000039
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748891511174
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:11:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 19:11:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:11:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 627 ms
[2025-06-02 19:11:53] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 19:11:53] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2025-06-02 19:11:53] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:11:53] [INFO ] Computed 26 invariants in 14 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 9, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0] Max Struct:[1, 20, 11, 2, 2, 10, 1, 3, 10, 2, 1, 2, 2, 1, 10, 1]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:11:53] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:11:53] [INFO ] Computed 26 invariants in 13 ms
[2025-06-02 19:11:53] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-06-02 19:11:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:11:53] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-02 19:11:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:11:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:11:53] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 19:11:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:11:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2025-06-02 19:11:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-02 19:11:53] [INFO ] Added : 9 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 144 ms.
[2025-06-02 19:11:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 19:11:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:53] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 19:11:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2025-06-02 19:11:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 18 ms to minimize.
[2025-06-02 19:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-06-02 19:11:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:11:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2025-06-02 19:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-02 19:11:54] [INFO ] Added : 54 causal constraints over 11 iterations in 161 ms. Result :sat
Minimization took 29 ms.
[2025-06-02 19:11:54] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Real]Added 8 Read/Feed constraints in 7 ms returned sat
[2025-06-02 19:11:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-02 19:11:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:11:54] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 16 ms.
[2025-06-02 19:11:54] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:11:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2025-06-02 19:11:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:11:54] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:11:54] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:11:54] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:11:54] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2025-06-02 19:11:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 186 ms
[2025-06-02 19:11:54] [INFO ] Added : 58 causal constraints over 13 iterations in 296 ms. Result :sat
Minimization took 31 ms.
[2025-06-02 19:11:54] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:11:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:11:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:11:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 19:11:55] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:11:55] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:11:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2025-06-02 19:11:55] [INFO ] Added : 58 causal constraints over 12 iterations in 201 ms. Result :sat
Minimization took 26 ms.
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:11:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2025-06-02 19:11:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:11:55] [INFO ] Added : 58 causal constraints over 13 iterations in 112 ms. Result :sat
Minimization took 39 ms.
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:11:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:11:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:11:55] [INFO ] Added : 52 causal constraints over 11 iterations in 78 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:11:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:11:55] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 17 ms.
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:11:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:11:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:11:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:11:56] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:11:56] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:11:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2025-06-02 19:11:56] [INFO ] Added : 56 causal constraints over 12 iterations in 194 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 19:11:56] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 19:11:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 23 ms returned sat
[2025-06-02 19:11:56] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-02 19:11:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:11:56] [INFO ] Added : 61 causal constraints over 13 iterations in 108 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 19:11:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:11:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:11:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:11:56] [INFO ] Added : 54 causal constraints over 11 iterations in 75 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:11:56] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:11:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:11:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:11:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:11:57] [INFO ] Added : 61 causal constraints over 15 iterations in 119 ms. Result :sat
Minimization took 68 ms.
[2025-06-02 19:11:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:11:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:11:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:11:57] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:11:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-02 19:11:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:11:57] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[20, 11, 2, 2, 10, 3, 10, 2, 1, 2, 1, 10, 1]
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 19:11:57] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 42 ms.
[2025-06-02 19:11:57] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 9, 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]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[20, 11, 2, 2, 10, 3, 10, 2, 1, 2, 1, 10, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[20, 11, 2, 2, 10, 3, 10, 2, 1, 2, 1, 10, 1]
[2025-06-02 19:11:57] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2025-06-02 19:11:57] [INFO ] Computed 58 invariants in 67 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[20, 11, 2, 2, 10, 3, 10, 2, 1, 2, 1, 10, 1]
RANDOM walk for 10000 steps (3 resets) in 90 ms. (109 steps per ms)
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90005 steps (21 resets) in 292 ms. (307 steps per ms)
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[2, 10, 1, 1, 0, 1, 1, 1] Max Struct:[20, 11, 2, 10, 3, 10, 2, 2]
[2025-06-02 19:11:57] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2025-06-02 19:11:57] [INFO ] Invariant cache hit.
[2025-06-02 19:11:57] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2025-06-02 19:11:57] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 35 ms returned sat
[2025-06-02 19:11:58] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2025-06-02 19:11:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:11:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2025-06-02 19:11:58] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 36 ms returned sat
[2025-06-02 19:11:59] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2025-06-02 19:11:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:11:59] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:12:00] [INFO ] [Nat]Added 120 Read/Feed constraints in 584 ms returned sat
[2025-06-02 19:12:00] [INFO ] Computed and/alt/rep : 780/1548/770 causal constraints (skipped 860 transitions) in 142 ms.
[2025-06-02 19:12:01] [INFO ] Deduced a trap composed of 566 places in 363 ms of which 5 ms to minimize.
[2025-06-02 19:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 496 ms
[2025-06-02 19:12:02] [INFO ] Added : 59 causal constraints over 13 iterations in 1958 ms. Result :sat
Minimization took 588 ms.
[2025-06-02 19:12:02] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2025-06-02 19:12:02] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 23 ms returned unsat
[2025-06-02 19:12:02] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2025-06-02 19:12:02] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 34 ms returned unsat
[2025-06-02 19:12:03] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2025-06-02 19:12:03] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 35 ms returned unsat
[2025-06-02 19:12:03] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2025-06-02 19:12:03] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 37 ms returned sat
[2025-06-02 19:12:03] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2025-06-02 19:12:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:12:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2025-06-02 19:12:04] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 41 ms returned sat
[2025-06-02 19:12:04] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2025-06-02 19:12:05] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:12:05] [INFO ] [Nat]Added 120 Read/Feed constraints in 1011 ms returned unknown
[2025-06-02 19:12:05] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2025-06-02 19:12:06] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 32 ms returned unsat
[2025-06-02 19:12:06] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2025-06-02 19:12:06] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 23 ms returned unsat
[2025-06-02 19:12:06] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2025-06-02 19:12:06] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 10, 1, 1, 0, 1, 1, 1] Max Struct:[20, 10, 1, 1, 3, 1, 1, 1]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[20, 3]
Support contains 11 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 842 transition count 1572
Reduce places removed 80 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 90 rules applied. Total rules applied 172 place count 762 transition count 1562
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 522 place count 582 transition count 1392
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 532 place count 582 transition count 1382
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 542 place count 572 transition count 1382
Applied a total of 542 rules in 242 ms. Remains 572 /844 variables (removed 272) and now considering 1382/1652 (removed 270) transitions.
Running 1380 sub problems to find dead transitions.
[2025-06-02 19:12:06] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
// Phase 1: matrix 1362 rows 572 cols
[2025-06-02 19:12:06] [INFO ] Computed 56 invariants in 36 ms
[2025-06-02 19:12:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2025-06-02 19:12:23] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2025-06-02 19:12:23] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2025-06-02 19:12:23] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:12:23] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:12:23] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:12:23] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 2 ms to minimize.
[2025-06-02 19:12:23] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2025-06-02 19:12:23] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:12:23] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:12:24] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 2 ms to minimize.
[2025-06-02 19:12:24] [INFO ] Deduced a trap composed of 202 places in 272 ms of which 4 ms to minimize.
[2025-06-02 19:12:24] [INFO ] Deduced a trap composed of 210 places in 291 ms of which 4 ms to minimize.
[2025-06-02 19:12:26] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 4 ms to minimize.
[2025-06-02 19:12:26] [INFO ] Deduced a trap composed of 205 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1934 variables, and 68 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2025-06-02 19:12:32] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 3 ms to minimize.
[2025-06-02 19:12:32] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2025-06-02 19:12:34] [INFO ] Deduced a trap composed of 222 places in 277 ms of which 3 ms to minimize.
[2025-06-02 19:12:48] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 6)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1934 variables, and 72 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 18/18 constraints]
After SMT, in 43070ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 43099ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43372 ms. Remains : 572/844 places, 1382/1652 transitions.
[2025-06-02 19:12:49] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2025-06-02 19:12:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[20, 3]
RANDOM walk for 1000001 steps (308 resets) in 4071 ms. (245 steps per ms)
BEST_FIRST walk for 2000001 steps (226 resets) in 3830 ms. (522 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0] Max Struct:[20, 3]
[2025-06-02 19:12:57] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2025-06-02 19:12:57] [INFO ] Invariant cache hit.
[2025-06-02 19:12:57] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-02 19:12:57] [INFO ] [Real]Absence check using 15 positive and 41 generalized place invariants in 20 ms returned sat
[2025-06-02 19:12:58] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-06-02 19:12:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:12:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2025-06-02 19:12:58] [INFO ] [Nat]Absence check using 15 positive and 41 generalized place invariants in 21 ms returned sat
[2025-06-02 19:12:59] [INFO ] [Nat]Absence check using state equation in 940 ms returned sat
[2025-06-02 19:12:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:12:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 782 ms returned sat
[2025-06-02 19:13:00] [INFO ] Computed and/alt/rep : 510/1138/500 causal constraints (skipped 860 transitions) in 84 ms.
[2025-06-02 19:13:00] [INFO ] Added : 37 causal constraints over 8 iterations in 738 ms. Result :sat
Minimization took 4752 ms.
[2025-06-02 19:13:05] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-02 19:13:05] [INFO ] [Real]Absence check using 15 positive and 41 generalized place invariants in 19 ms returned sat
[2025-06-02 19:13:06] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2025-06-02 19:13:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:13:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2025-06-02 19:13:06] [INFO ] [Nat]Absence check using 15 positive and 41 generalized place invariants in 20 ms returned sat
[2025-06-02 19:13:07] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2025-06-02 19:13:07] [INFO ] [Nat]Added 120 Read/Feed constraints in 681 ms returned sat
[2025-06-02 19:13:07] [INFO ] Computed and/alt/rep : 510/1138/500 causal constraints (skipped 860 transitions) in 93 ms.
[2025-06-02 19:13:08] [INFO ] Added : 38 causal constraints over 8 iterations in 795 ms. Result :sat
Minimization took 4691 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0] Max Struct:[20, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[20, 3]
Support contains 11 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 1382/1382 transitions.
Applied a total of 0 rules in 40 ms. Remains 572 /572 variables (removed 0) and now considering 1382/1382 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 572/572 places, 1382/1382 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 1382/1382 transitions.
Applied a total of 0 rules in 30 ms. Remains 572 /572 variables (removed 0) and now considering 1382/1382 (removed 0) transitions.
[2025-06-02 19:13:13] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2025-06-02 19:13:13] [INFO ] Invariant cache hit.
[2025-06-02 19:13:13] [INFO ] Implicit Places using invariants in 493 ms returned [516, 517, 518, 519, 520, 521, 522, 523, 524, 525]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 496 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/572 places, 1382/1382 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 552 transition count 1372
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 552 transition count 1372
Applied a total of 20 rules in 43 ms. Remains 552 /562 variables (removed 10) and now considering 1372/1382 (removed 10) transitions.
[2025-06-02 19:13:13] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
// Phase 1: matrix 1352 rows 552 cols
[2025-06-02 19:13:13] [INFO ] Computed 46 invariants in 34 ms
[2025-06-02 19:13:14] [INFO ] Implicit Places using invariants in 488 ms returned []
[2025-06-02 19:13:14] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:13:14] [INFO ] Invariant cache hit.
[2025-06-02 19:13:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:13:24] [INFO ] Implicit Places using invariants and state equation in 10280 ms returned []
Implicit Place search using SMT with State Equation took 10774 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 552/572 places, 1372/1382 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11345 ms. Remains : 552/572 places, 1372/1382 transitions.
[2025-06-02 19:13:24] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:13:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[20, 3]
RANDOM walk for 1000000 steps (322 resets) in 3764 ms. (265 steps per ms)
BEST_FIRST walk for 2000002 steps (262 resets) in 3482 ms. (574 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0] Max Struct:[20, 3]
[2025-06-02 19:13:31] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:13:31] [INFO ] Invariant cache hit.
[2025-06-02 19:13:32] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2025-06-02 19:13:32] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 19 ms returned sat
[2025-06-02 19:13:32] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2025-06-02 19:13:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:13:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-02 19:13:32] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 19 ms returned sat
[2025-06-02 19:13:33] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2025-06-02 19:13:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:13:33] [INFO ] [Nat]Added 120 Read/Feed constraints in 473 ms returned sat
[2025-06-02 19:13:33] [INFO ] Computed and/alt/rep : 500/1118/490 causal constraints (skipped 860 transitions) in 113 ms.
[2025-06-02 19:13:34] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 3 ms to minimize.
[2025-06-02 19:13:35] [INFO ] Deduced a trap composed of 215 places in 255 ms of which 4 ms to minimize.
[2025-06-02 19:13:35] [INFO ] Deduced a trap composed of 210 places in 268 ms of which 3 ms to minimize.
[2025-06-02 19:13:36] [INFO ] Deduced a trap composed of 205 places in 258 ms of which 3 ms to minimize.
[2025-06-02 19:13:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1529 ms
[2025-06-02 19:13:36] [INFO ] Added : 42 causal constraints over 9 iterations in 2489 ms. Result :sat
Minimization took 4502 ms.
[2025-06-02 19:13:40] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-02 19:13:40] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 28 ms returned sat
[2025-06-02 19:13:41] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2025-06-02 19:13:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:13:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:13:41] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 21 ms returned sat
[2025-06-02 19:13:42] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2025-06-02 19:13:43] [INFO ] [Nat]Added 120 Read/Feed constraints in 1617 ms returned sat
[2025-06-02 19:13:43] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 4 ms to minimize.
[2025-06-02 19:13:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1153 ms
[2025-06-02 19:13:44] [INFO ] Computed and/alt/rep : 500/1118/490 causal constraints (skipped 860 transitions) in 77 ms.
[2025-06-02 19:13:45] [INFO ] Added : 25 causal constraints over 5 iterations in 857 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0] Max Struct:[20, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[20, 3]
Support contains 11 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 25 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 552/552 places, 1372/1372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 21 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2025-06-02 19:13:50] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:13:50] [INFO ] Invariant cache hit.
[2025-06-02 19:13:50] [INFO ] Implicit Places using invariants in 463 ms returned []
[2025-06-02 19:13:50] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:13:50] [INFO ] Invariant cache hit.
[2025-06-02 19:13:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:14:00] [INFO ] Implicit Places using invariants and state equation in 10220 ms returned []
Implicit Place search using SMT with State Equation took 10683 ms to find 0 implicit places.
[2025-06-02 19:14:00] [INFO ] Redundant transitions in 70 ms returned []
Running 1370 sub problems to find dead transitions.
[2025-06-02 19:14:01] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:14:01] [INFO ] Invariant cache hit.
[2025-06-02 19:14:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:14:16] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2025-06-02 19:14:16] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2025-06-02 19:14:16] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:14:16] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:14:17] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:14:17] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:14:17] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:14:17] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:14:17] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:14:17] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 3 ms to minimize.
[2025-06-02 19:14:17] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 4 ms to minimize.
[2025-06-02 19:14:26] [INFO ] Deduced a trap composed of 195 places in 241 ms of which 3 ms to minimize.
[2025-06-02 19:14:32] [INFO ] Deduced a trap composed of 208 places in 246 ms of which 3 ms to minimize.
[2025-06-02 19:14:32] [INFO ] Deduced a trap composed of 186 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 58 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:14:51] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 2 ms to minimize.
[2025-06-02 19:14:52] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2025-06-02 19:14:56] [INFO ] Deduced a trap composed of 343 places in 268 ms of which 3 ms to minimize.
[2025-06-02 19:14:57] [INFO ] Deduced a trap composed of 366 places in 255 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 62 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 18/18 constraints]
After SMT, in 62596ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 62612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73408 ms. Remains : 552/552 places, 1372/1372 transitions.
RANDOM walk for 40000 steps (17 resets) in 1324 ms. (30 steps per ms) remains 4/4 properties
[2025-06-02 19:15:04] [INFO ] Flatten gal took : 421 ms
BEST_FIRST walk for 40002 steps (9 resets) in 573 ms. (69 steps per ms) remains 4/4 properties
[2025-06-02 19:15:04] [INFO ] Flatten gal took : 155 ms
BEST_FIRST walk for 40004 steps (9 resets) in 334 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
[2025-06-02 19:15:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2294946850068348936.gal : 76 ms
[2025-06-02 19:15:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7830121777650429246.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/ReachabilityCardinality2294946850068348936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7830121777650429246.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 40003 steps (10 resets) in 435 ms. (91 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality7830121777650429246.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :10 after 38
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :38 after 80
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :430 after 2642
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2642 after 6926
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :6926 after 8062
Interrupted probabilistic random walk after 146848 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 146848 steps, saw 86815 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
[2025-06-02 19:15:07] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:15:07] [INFO ] Invariant cache hit.
[2025-06-02 19:15:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 226/237 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 19:15:08] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 2 ms to minimize.
[2025-06-02 19:15:08] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2025-06-02 19:15:08] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2025-06-02 19:15:08] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2025-06-02 19:15:08] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2025-06-02 19:15:08] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2025-06-02 19:15:08] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 7/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/547 variables, 4/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/550 variables, 3/52 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1352/1902 variables, 550/602 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1902 variables, 120/722 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1902 variables, 0/722 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1904 variables, 2/724 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1904 variables, 1/725 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1904/1904 variables, and 725 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1996 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 226/237 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 7/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 19:15:09] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/547 variables, 4/50 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/550 variables, 3/53 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1352/1902 variables, 550/603 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8062 after 10916
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/1904 variables, and 723 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2666 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 550/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 4676ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 198 ms.
Support contains 11 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 20 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1370 sub problems to find dead transitions.
[2025-06-02 19:15:12] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:15:12] [INFO ] Invariant cache hit.
[2025-06-02 19:15:12] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :10916 after 15544
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :15544 after 26916
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:15:28] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2025-06-02 19:15:28] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2025-06-02 19:15:28] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:15:28] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:15:28] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:15:28] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 0 ms to minimize.
[2025-06-02 19:15:28] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:15:29] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:15:29] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:15:29] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 3 ms to minimize.
[2025-06-02 19:15:29] [INFO ] Deduced a trap composed of 197 places in 268 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 55 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:15:38] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2025-06-02 19:15:43] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :26916 after 329276
Detected timeout of ITS tools.
[2025-06-02 19:15:54] [INFO ] Flatten gal took : 84 ms
[2025-06-02 19:15:54] [INFO ] Applying decomposition
[2025-06-02 19:15:54] [INFO ] Flatten gal took : 73 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/graph9775063456135340650.txt' '-o' '/tmp/graph9775063456135340650.bin' '-w' '/tmp/graph9775063456135340650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9775063456135340650.bin' '-l' '-1' '-v' '-w' '/tmp/graph9775063456135340650.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:15:55] [INFO ] Decomposing Gal with order
[2025-06-02 19:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 57 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 13/13 constraints]
After SMT, in 42788ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 42802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42826 ms. Remains : 552/552 places, 1372/1372 transitions.
[2025-06-02 19:15:55] [INFO ] Removed a total of 954 redundant transitions.
RANDOM walk for 40000 steps (11 resets) in 532 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
[2025-06-02 19:15:55] [INFO ] Flatten gal took : 433 ms
BEST_FIRST walk for 40004 steps (9 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
[2025-06-02 19:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 460 labels/synchronizations in 45 ms.
BEST_FIRST walk for 40002 steps (13 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
[2025-06-02 19:15:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12366577625608367337.gal : 54 ms
[2025-06-02 19:15:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14542989507403290497.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/ReachabilityCardinality12366577625608367337.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14542989507403290497.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 ...330
Loading property file /tmp/ReachabilityCardinality14542989507403290497.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :12 after 16
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :16 after 18
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :18 after 40
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :40 after 50
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :50 after 156
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :156 after 668
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :668 after 1274
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1274 after 1496
Interrupted probabilistic random walk after 139890 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 3
Probabilistic random walk after 139890 steps, saw 82858 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2025-06-02 19:15:58] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:15:58] [INFO ] Invariant cache hit.
[2025-06-02 19:15:58] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1496 after 2740
At refinement iteration 1 (OVERLAPS) 226/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2025-06-02 19:15:59] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/547 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/550 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1352/1902 variables, 550/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2740 after 7218
At refinement iteration 15 (INCLUDED_ONLY) 0/1902 variables, 120/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1902 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1904 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1904 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1904/1904 variables, and 725 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2320 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 226/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 19:16:01] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/547 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/550 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1352/1902 variables, 550/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1902 variables, 120/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7218 after 31165
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/1902 variables, 3/726 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1902 variables, 0/726 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1904 variables, 2/728 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1904 variables, 1/729 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2025-06-02 19:16:11] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1904 variables, 1/730 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1904 variables, 0/730 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1904 variables, 0/730 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1904/1904 variables, and 730 constraints, problems are : Problem set: 2 solved, 1 unsolved in 10855 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 13189ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 10 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 18 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 552/552 places, 1372/1372 transitions.
RANDOM walk for 40000 steps (15 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 262688 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 262688 steps, saw 152356 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2025-06-02 19:16:15] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:16:15] [INFO ] Invariant cache hit.
[2025-06-02 19:16:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/547 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/550 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1352/1902 variables, 550/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1902 variables, 120/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1902 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1904 variables, 2/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1904 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1904 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1904 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1904/1904 variables, and 718 constraints, problems are : Problem set: 0 solved, 1 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:16:16] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
[2025-06-02 19:16:16] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2025-06-02 19:16:16] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2025-06-02 19:16:16] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2025-06-02 19:16:16] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2025-06-02 19:16:16] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/547 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/550 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1352/1902 variables, 550/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1902 variables, 120/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1902 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1902 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1904 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1904 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1904/1904 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2967 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3777ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 10 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 18 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 552/552 places, 1372/1372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 17 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2025-06-02 19:16:18] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:16:18] [INFO ] Invariant cache hit.
[2025-06-02 19:16:19] [INFO ] Implicit Places using invariants in 479 ms returned []
[2025-06-02 19:16:19] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:16:19] [INFO ] Invariant cache hit.
[2025-06-02 19:16:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:16:29] [INFO ] Implicit Places using invariants and state equation in 9808 ms returned []
Implicit Place search using SMT with State Equation took 10289 ms to find 0 implicit places.
[2025-06-02 19:16:29] [INFO ] Redundant transitions in 18 ms returned []
Running 1370 sub problems to find dead transitions.
[2025-06-02 19:16:29] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:16:29] [INFO ] Invariant cache hit.
[2025-06-02 19:16:29] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :31165 after 101183
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:16:44] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2025-06-02 19:16:44] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2025-06-02 19:16:45] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:16:45] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:16:45] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:16:45] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:16:45] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:16:45] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:16:45] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2025-06-02 19:16:45] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 3 ms to minimize.
[2025-06-02 19:16:46] [INFO ] Deduced a trap composed of 197 places in 297 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:16:54] [INFO ] Deduced a trap composed of 195 places in 247 ms of which 3 ms to minimize.
[2025-06-02 19:17:00] [INFO ] Deduced a trap composed of 208 places in 249 ms of which 3 ms to minimize.
[2025-06-02 19:17:00] [INFO ] Deduced a trap composed of 186 places in 249 ms of which 3 ms to minimize.
[2025-06-02 19:17:01] [INFO ] Deduced a trap composed of 171 places in 246 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 59 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:17:10] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 3 ms to minimize.
[2025-06-02 19:17:15] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2025-06-02 19:17:24] [INFO ] Deduced a trap composed of 157 places in 251 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 62 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 18/18 constraints]
After SMT, in 62672ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 62686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73017 ms. Remains : 552/552 places, 1372/1372 transitions.
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-07 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[2] Max Struct:[20]
Starting property specific reduction for PolyORBLF-COL-S02J06T10-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2025-06-02 19:17:31] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:17:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (3 resets) in 39 ms. (250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:17:32] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:17:32] [INFO ] Invariant cache hit.
[2025-06-02 19:17:32] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-02 19:17:32] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 19 ms returned sat
[2025-06-02 19:17:32] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2025-06-02 19:17:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:17:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:17:32] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 20 ms returned sat
[2025-06-02 19:17:33] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2025-06-02 19:17:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:17:33] [INFO ] [Nat]Added 120 Read/Feed constraints in 471 ms returned sat
[2025-06-02 19:17:33] [INFO ] Computed and/alt/rep : 500/1118/490 causal constraints (skipped 860 transitions) in 72 ms.
[2025-06-02 19:17:34] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 3 ms to minimize.
[2025-06-02 19:17:35] [INFO ] Deduced a trap composed of 215 places in 267 ms of which 3 ms to minimize.
[2025-06-02 19:17:35] [INFO ] Deduced a trap composed of 210 places in 276 ms of which 4 ms to minimize.
[2025-06-02 19:17:36] [INFO ] Deduced a trap composed of 205 places in 259 ms of which 4 ms to minimize.
[2025-06-02 19:17:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1563 ms
[2025-06-02 19:17:36] [INFO ] Added : 42 causal constraints over 9 iterations in 2475 ms. Result :sat
Minimization took 546 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 23 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1370 sub problems to find dead transitions.
[2025-06-02 19:17:36] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:17:36] [INFO ] Invariant cache hit.
[2025-06-02 19:17:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:17:52] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2025-06-02 19:17:52] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2025-06-02 19:17:52] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:17:53] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:17:53] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:17:53] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:17:53] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:17:53] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:17:53] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:17:53] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
[2025-06-02 19:17:54] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 55 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:18:02] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2025-06-02 19:18:08] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 57 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 13/13 constraints]
After SMT, in 42579ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 42592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42618 ms. Remains : 552/552 places, 1372/1372 transitions.
[2025-06-02 19:18:19] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:18:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (331 resets) in 3722 ms. (268 steps per ms)
BEST_FIRST walk for 1000000 steps (114 resets) in 1749 ms. (571 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:18:25] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:18:25] [INFO ] Invariant cache hit.
[2025-06-02 19:18:25] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2025-06-02 19:18:25] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 18 ms returned sat
[2025-06-02 19:18:25] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2025-06-02 19:18:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:18:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-02 19:18:25] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 21 ms returned sat
[2025-06-02 19:18:26] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2025-06-02 19:18:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:18:26] [INFO ] [Nat]Added 120 Read/Feed constraints in 479 ms returned sat
[2025-06-02 19:18:26] [INFO ] Computed and/alt/rep : 500/1118/490 causal constraints (skipped 860 transitions) in 70 ms.
[2025-06-02 19:18:27] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 3 ms to minimize.
[2025-06-02 19:18:28] [INFO ] Deduced a trap composed of 215 places in 272 ms of which 3 ms to minimize.
[2025-06-02 19:18:28] [INFO ] Deduced a trap composed of 210 places in 269 ms of which 4 ms to minimize.
[2025-06-02 19:18:29] [INFO ] Deduced a trap composed of 205 places in 263 ms of which 4 ms to minimize.
[2025-06-02 19:18:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1564 ms
[2025-06-02 19:18:29] [INFO ] Added : 42 causal constraints over 9 iterations in 2486 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 10 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 26 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 552/552 places, 1372/1372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 17 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2025-06-02 19:18:33] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:18:33] [INFO ] Invariant cache hit.
[2025-06-02 19:18:34] [INFO ] Implicit Places using invariants in 467 ms returned []
[2025-06-02 19:18:34] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:18:34] [INFO ] Invariant cache hit.
[2025-06-02 19:18:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:18:44] [INFO ] Implicit Places using invariants and state equation in 9790 ms returned []
Implicit Place search using SMT with State Equation took 10260 ms to find 0 implicit places.
[2025-06-02 19:18:44] [INFO ] Redundant transitions in 77 ms returned []
Running 1370 sub problems to find dead transitions.
[2025-06-02 19:18:44] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:18:44] [INFO ] Invariant cache hit.
[2025-06-02 19:18:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:18:59] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2025-06-02 19:18:59] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2025-06-02 19:19:00] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:19:00] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:19:00] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:19:00] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:19:00] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:19:00] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:19:00] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:19:00] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 4 ms to minimize.
[2025-06-02 19:19:01] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 4 ms to minimize.
[2025-06-02 19:19:09] [INFO ] Deduced a trap composed of 195 places in 246 ms of which 3 ms to minimize.
[2025-06-02 19:19:15] [INFO ] Deduced a trap composed of 208 places in 231 ms of which 4 ms to minimize.
[2025-06-02 19:19:15] [INFO ] Deduced a trap composed of 186 places in 231 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 58 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:19:34] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 2 ms to minimize.
[2025-06-02 19:19:34] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2025-06-02 19:19:39] [INFO ] Deduced a trap composed of 343 places in 249 ms of which 4 ms to minimize.
[2025-06-02 19:19:40] [INFO ] Deduced a trap composed of 366 places in 245 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 62 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 18/18 constraints]
After SMT, in 62426ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 62439ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72801 ms. Remains : 552/552 places, 1372/1372 transitions.
RANDOM walk for 40000 steps (19 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
[2025-06-02 19:19:46] [INFO ] Flatten gal took : 108 ms
BEST_FIRST walk for 40004 steps (12 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
[2025-06-02 19:19:46] [INFO ] Flatten gal took : 69 ms
[2025-06-02 19:19:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4454661625180122528.gal : 12 ms
[2025-06-02 19:19:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality753141076599606487.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/ReachabilityCardinality4454661625180122528.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality753141076599606487.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/ReachabilityCardinality753141076599606487.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 38
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38 after 80
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :430 after 2642
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2642 after 6926
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6926 after 8062
Interrupted probabilistic random walk after 198487 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 198487 steps, saw 116233 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-06-02 19:19:49] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:19:49] [INFO ] Invariant cache hit.
[2025-06-02 19:19:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 227/237 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:19:50] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2025-06-02 19:19:50] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:19:50] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2025-06-02 19:19:50] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2025-06-02 19:19:50] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2025-06-02 19:19:50] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:19:50] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 7/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/547 variables, 4/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/550 variables, 3/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1352/1902 variables, 550/602 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1902 variables, 120/722 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1902 variables, 0/722 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1904 variables, 2/724 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1904 variables, 1/725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1904/1904 variables, and 725 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1686 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/237 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 7/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:19:51] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/547 variables, 4/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/550 variables, 3/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1352/1902 variables, 550/603 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8062 after 10916
After SMT solving in domain Int declared 1902/1904 variables, and 723 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1638 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 550/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 3341ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 10 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 16 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1370 sub problems to find dead transitions.
[2025-06-02 19:19:53] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:19:53] [INFO ] Invariant cache hit.
[2025-06-02 19:19:53] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10916 after 15544
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:20:08] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2025-06-02 19:20:08] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:20:08] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:20:08] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:20:08] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:20:08] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:20:08] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:20:08] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2025-06-02 19:20:08] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:20:09] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :15544 after 26916
[2025-06-02 19:20:09] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 55 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:20:19] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2025-06-02 19:20:24] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :26916 after 329276
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 57 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 13/13 constraints]
After SMT, in 42653ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 42665ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42684 ms. Remains : 552/552 places, 1372/1372 transitions.
RANDOM walk for 40000 steps (16 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2025-06-02 19:20:37] [INFO ] Flatten gal took : 57 ms
[2025-06-02 19:20:37] [INFO ] Applying decomposition
[2025-06-02 19:20:37] [INFO ] Flatten gal took : 57 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/graph14126514603182445981.txt' '-o' '/tmp/graph14126514603182445981.bin' '-w' '/tmp/graph14126514603182445981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14126514603182445981.bin' '-l' '-1' '-v' '-w' '/tmp/graph14126514603182445981.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:20:37] [INFO ] Decomposing Gal with order
[2025-06-02 19:20:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:20:37] [INFO ] Removed a total of 1103 redundant transitions.
[2025-06-02 19:20:37] [INFO ] Flatten gal took : 156 ms
[2025-06-02 19:20:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 392 labels/synchronizations in 31 ms.
[2025-06-02 19:20:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2100518388998871934.gal : 10 ms
[2025-06-02 19:20:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11665244071136196845.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/ReachabilityCardinality2100518388998871934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11665244071136196845.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/ReachabilityCardinality11665244071136196845.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 38
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :38 after 80
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :80 after 206
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :430 after 3398
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3398 after 7952
Interrupted probabilistic random walk after 259620 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 259620 steps, saw 150620 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2025-06-02 19:20:39] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:20:39] [INFO ] Invariant cache hit.
[2025-06-02 19:20:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/547 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/550 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1352/1902 variables, 550/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7952 after 8317
At refinement iteration 14 (INCLUDED_ONLY) 0/1902 variables, 120/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1902 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1904 variables, 2/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1904 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1904 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1904 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1904/1904 variables, and 718 constraints, problems are : Problem set: 0 solved, 1 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/266 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/280 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 263/543 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:20:40] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2025-06-02 19:20:40] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 3 ms to minimize.
[2025-06-02 19:20:40] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2025-06-02 19:20:40] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2025-06-02 19:20:40] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2025-06-02 19:20:40] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/547 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/550 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1352/1902 variables, 550/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1902 variables, 120/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1902 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1902 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1904 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1904 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1904/1904 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2976 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3818ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 10 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 17 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 552/552 places, 1372/1372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1372/1372 transitions.
Applied a total of 0 rules in 34 ms. Remains 552 /552 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2025-06-02 19:20:43] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:20:43] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8317 after 12691
[2025-06-02 19:20:43] [INFO ] Implicit Places using invariants in 470 ms returned []
[2025-06-02 19:20:43] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:20:43] [INFO ] Invariant cache hit.
[2025-06-02 19:20:44] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12691 after 15681
[2025-06-02 19:20:53] [INFO ] Implicit Places using invariants and state equation in 9831 ms returned []
Implicit Place search using SMT with State Equation took 10305 ms to find 0 implicit places.
[2025-06-02 19:20:53] [INFO ] Redundant transitions in 24 ms returned []
Running 1370 sub problems to find dead transitions.
[2025-06-02 19:20:53] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2025-06-02 19:20:53] [INFO ] Invariant cache hit.
[2025-06-02 19:20:53] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :59526 after 120320
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:21:09] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2025-06-02 19:21:09] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2025-06-02 19:21:09] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:21:09] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:21:09] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:21:09] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:21:09] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:21:09] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:21:09] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2025-06-02 19:21:10] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 3 ms to minimize.
[2025-06-02 19:21:10] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 3 ms to minimize.
[2025-06-02 19:21:18] [INFO ] Deduced a trap composed of 195 places in 256 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :120320 after 507837
[2025-06-02 19:21:24] [INFO ] Deduced a trap composed of 208 places in 247 ms of which 3 ms to minimize.
[2025-06-02 19:21:24] [INFO ] Deduced a trap composed of 186 places in 245 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 10.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 58 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2025-06-02 19:21:44] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2025-06-02 19:21:44] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2025-06-02 19:21:49] [INFO ] Deduced a trap composed of 343 places in 239 ms of which 3 ms to minimize.
[2025-06-02 19:21:50] [INFO ] Deduced a trap composed of 366 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 62 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 18/18 constraints]
After SMT, in 62666ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 62679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73049 ms. Remains : 552/552 places, 1372/1372 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J06T10-UpperBounds-01 in 264059 ms.
[2025-06-02 19:21:56] [INFO ] Flatten gal took : 66 ms
[2025-06-02 19:21:56] [INFO ] Applying decomposition
[2025-06-02 19:21:56] [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/graph10812109080755937998.txt' '-o' '/tmp/graph10812109080755937998.bin' '-w' '/tmp/graph10812109080755937998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10812109080755937998.bin' '-l' '-1' '-v' '-w' '/tmp/graph10812109080755937998.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:21:56] [INFO ] Decomposing Gal with order
[2025-06-02 19:21:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:21:56] [INFO ] Removed a total of 1048 redundant transitions.
[2025-06-02 19:21:56] [INFO ] Flatten gal took : 142 ms
[2025-06-02 19:21:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 860 labels/synchronizations in 43 ms.
[2025-06-02 19:21:56] [INFO ] Time to serialize gal into /tmp/UpperBounds11029208175142115534.gal : 9 ms
[2025-06-02 19:21:56] [INFO ] Time to serialize properties into /tmp/UpperBounds13545289273216404478.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/UpperBounds11029208175142115534.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13545289273216404478.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 ...306
Loading property file /tmp/UpperBounds13545289273216404478.prop.
ITS-tools command line returned an error code 137
[2025-06-02 19:31:16] [INFO ] Applying decomposition
[2025-06-02 19:31:17] [INFO ] Flatten gal took : 51 ms
[2025-06-02 19:31:17] [INFO ] Decomposing Gal with order
[2025-06-02 19:31:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:31:17] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, P_1113_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, Check_Sources_B_0, Check_Sources_E_0, P_1617_0],[AwakeTasks_1, IdleTasks_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, P_1113_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, Check_Sources_B_1, Check_Sources_E_1, P_1617_1],[AwakeTasks_2, IdleTasks_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, P_1113_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, Check_Sources_B_2, Check_Sources_E_2, P_1617_2],[AwakeTasks_3, IdleTasks_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, P_1113_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, Check_Sources_B_3, Check_Sources_E_3, P_1617_3],[AwakeTasks_4, IdleTasks_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, P_1113_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, Check_Sources_B_4, Check_Sources_E_4, P_1617_4],[AwakeTasks_5, IdleTasks_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, P_1113_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, Check_Sources_B_5, Check_Sources_E_5, P_1617_5],[AwakeTasks_6, IdleTasks_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, P_1113_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, Check_Sources_B_6, Check_Sources_E_6, P_1617_6],[AwakeTasks_7, IdleTasks_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, P_1113_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, Check_Sources_B_7, Check_Sources_E_7, P_1617_7],[AwakeTasks_8, IdleTasks_8, QueueJobE_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, P_1113_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, Check_Sources_B_8, Check_Sources_E_8, P_1617_8],[AwakeTasks_9, IdleTasks_9, QueueJobE_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, P_1113_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, Check_Sources_B_9, Check_Sources_E_9, P_1617_9],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55],[NotifyEventJobQueuedB_56, QueueJobB_56, FetchJobE_56],[NotifyEventJobQueuedB_57, QueueJobB_57, FetchJobE_57],[NotifyEventJobQueuedB_58, QueueJobB_58, FetchJobE_58],[NotifyEventJobQueuedB_59, QueueJobB_59, FetchJobE_59],[NotifyEventJobQueuedB_60, QueueJobB_60, FetchJobE_60],[NotifyEventJobQueuedB_61, QueueJobB_61, FetchJobE_61],[NotifyEventJobQueuedB_62, QueueJobB_62, FetchJobE_62],[NotifyEventJobQueuedB_63, QueueJobB_63, FetchJobE_63],[NotifyEventJobQueuedB_64, QueueJobB_64, FetchJobE_64],[NotifyEventJobQueuedB_65, QueueJobB_65, FetchJobE_65],[NotifyEventJobQueuedB_66, QueueJobB_66, FetchJobE_66],[NotifyEventJobQueuedB_67, QueueJobB_67, FetchJobE_67],[NotifyEventJobQueuedB_68, QueueJobB_68, FetchJobE_68],[NotifyEventJobQueuedB_69, QueueJobB_69, FetchJobE_69],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[Insert_Source_B_0, P_1119_0, P_2579_0],[Insert_Source_B_1, P_1119_1, P_2579_1],[Insert_Source_B_2, P_1119_2, P_2579_2],[Insert_Source_B_3, P_1119_3, P_2579_3],[Insert_Source_B_4, P_1119_4, P_2579_4],[Insert_Source_B_5, P_1119_5, P_2579_5],[Insert_Source_B_6, P_1119_6, P_2579_6],[Insert_Source_B_7, P_1119_7, P_2579_7],[Insert_Source_B_8, P_1119_8, P_2579_8],[Insert_Source_B_9, P_1119_9, P_2579_9],[Insert_Source_B_10, P_1119_10, P_2579_10],[Insert_Source_B_11, P_1119_11, P_2579_11],[Insert_Source_B_12, P_1119_12, P_2579_12],[Insert_Source_B_13, P_1119_13, P_2579_13],[Insert_Source_B_14, P_1119_14, P_2579_14],[Insert_Source_B_15, P_1119_15, P_2579_15],[Insert_Source_B_16, P_1119_16, P_2579_16],[Insert_Source_B_17, P_1119_17, P_2579_17],[Insert_Source_B_18, P_1119_18, P_2579_18],[Insert_Source_B_19, P_1119_19, P_2579_19],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 19:31:17] [INFO ] Flatten gal took : 58 ms
[2025-06-02 19:31:17] [INFO ] Time to serialize gal into /tmp/UpperBounds1695078717674764288.gal : 8 ms
[2025-06-02 19:31:17] [INFO ] Time to serialize properties into /tmp/UpperBounds16678931084697753010.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/UpperBounds1695078717674764288.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16678931084697753010.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/UpperBounds16678931084697753010.prop.
ITS-tools command line returned an error code 137
[2025-06-02 19:47:11] [INFO ] Flatten gal took : 48 ms
[2025-06-02 19:47:11] [INFO ] Input system was already deterministic with 1372 transitions.
[2025-06-02 19:47:11] [INFO ] Transformed 552 places.
[2025-06-02 19:47:11] [INFO ] Transformed 1372 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 19:47:41] [INFO ] Time to serialize gal into /tmp/UpperBounds15790300823224210530.gal : 7 ms
[2025-06-02 19:47:41] [INFO ] Time to serialize properties into /tmp/UpperBounds17079164938541484202.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/UpperBounds15790300823224210530.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17079164938541484202.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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17079164938541484202.prop.
ITS-tools command line returned an error code 137
Total runtime 2737422 ms.
BK_STOP 1748894249837
--------------------
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="PolyORBLF-COL-S02J06T10"
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 PolyORBLF-COL-S02J06T10, 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 r167-tall-174881266000039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 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 ;