About the Execution of 2024-gold for FireWire-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15688.740 | 819905.00 | 1191888.00 | 2696.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800044.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 FireWire-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 153K 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 FireWire-PT-14-UpperBounds-00
FORMULA_NAME FireWire-PT-14-UpperBounds-01
FORMULA_NAME FireWire-PT-14-UpperBounds-02
FORMULA_NAME FireWire-PT-14-UpperBounds-03
FORMULA_NAME FireWire-PT-14-UpperBounds-04
FORMULA_NAME FireWire-PT-14-UpperBounds-05
FORMULA_NAME FireWire-PT-14-UpperBounds-06
FORMULA_NAME FireWire-PT-14-UpperBounds-07
FORMULA_NAME FireWire-PT-14-UpperBounds-08
FORMULA_NAME FireWire-PT-14-UpperBounds-09
FORMULA_NAME FireWire-PT-14-UpperBounds-10
FORMULA_NAME FireWire-PT-14-UpperBounds-11
FORMULA_NAME FireWire-PT-14-UpperBounds-12
FORMULA_NAME FireWire-PT-14-UpperBounds-13
FORMULA_NAME FireWire-PT-14-UpperBounds-14
FORMULA_NAME FireWire-PT-14-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748677277700
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:41:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 07:41:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:41:20] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2025-05-31 07:41:20] [INFO ] Transformed 205 places.
[2025-05-31 07:41:20] [INFO ] Transformed 610 transitions.
[2025-05-31 07:41:20] [INFO ] Found NUPN structural information;
[2025-05-31 07:41:20] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 613 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 40 ms.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:41:20] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
// Phase 1: matrix 501 rows 205 cols
[2025-05-31 07:41:21] [INFO ] Computed 10 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (294 resets) in 167 ms. (59 steps per ms)
FORMULA FireWire-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (339 resets) in 362 ms. (165 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 07:41:21] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
[2025-05-31 07:41:21] [INFO ] Invariant cache hit.
[2025-05-31 07:41:22] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2025-05-31 07:41:22] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2025-05-31 07:41:22] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-31 07:41:22] [INFO ] [Real]Added 73 Read/Feed constraints in 154 ms returned sat
[2025-05-31 07:41:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-05-31 07:41:23] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2025-05-31 07:41:23] [INFO ] [Nat]Added 73 Read/Feed constraints in 91 ms returned sat
[2025-05-31 07:41:23] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 251 ms.
[2025-05-31 07:41:24] [INFO ] Added : 16 causal constraints over 4 iterations in 624 ms. Result :sat
Minimization took 337 ms.
[2025-05-31 07:41:24] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-31 07:41:24] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2025-05-31 07:41:25] [INFO ] [Real]Added 73 Read/Feed constraints in 67 ms returned sat
[2025-05-31 07:41:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-05-31 07:41:25] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2025-05-31 07:41:25] [INFO ] [Nat]Added 73 Read/Feed constraints in 59 ms returned sat
[2025-05-31 07:41:25] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 93 ms.
[2025-05-31 07:41:26] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 34 ms to minimize.
[2025-05-31 07:41:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2025-05-31 07:41:26] [INFO ] Added : 41 causal constraints over 10 iterations in 1024 ms. Result :sat
Minimization took 307 ms.
[2025-05-31 07:41:26] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-31 07:41:27] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2025-05-31 07:41:27] [INFO ] [Real]Added 73 Read/Feed constraints in 78 ms returned sat
[2025-05-31 07:41:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 38 ms returned sat
[2025-05-31 07:41:27] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-05-31 07:41:28] [INFO ] [Nat]Added 73 Read/Feed constraints in 163 ms returned sat
[2025-05-31 07:41:28] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 162 ms.
[2025-05-31 07:41:28] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 14 ms to minimize.
[2025-05-31 07:41:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2025-05-31 07:41:29] [INFO ] Added : 36 causal constraints over 8 iterations in 972 ms. Result :sat
Minimization took 300 ms.
[2025-05-31 07:41:29] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-31 07:41:29] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2025-05-31 07:41:29] [INFO ] [Real]Added 73 Read/Feed constraints in 52 ms returned sat
[2025-05-31 07:41:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-31 07:41:30] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2025-05-31 07:41:30] [INFO ] [Nat]Added 73 Read/Feed constraints in 86 ms returned sat
[2025-05-31 07:41:30] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 139 ms.
[2025-05-31 07:41:32] [INFO ] Deduced a trap composed of 36 places in 1098 ms of which 3 ms to minimize.
[2025-05-31 07:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1181 ms
[2025-05-31 07:41:32] [INFO ] Added : 34 causal constraints over 11 iterations in 2156 ms. Result :sat
Minimization took 267 ms.
[2025-05-31 07:41:33] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-31 07:41:33] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-05-31 07:41:33] [INFO ] [Real]Added 73 Read/Feed constraints in 67 ms returned sat
[2025-05-31 07:41:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-31 07:41:33] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2025-05-31 07:41:33] [INFO ] [Nat]Added 73 Read/Feed constraints in 81 ms returned sat
[2025-05-31 07:41:34] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 67 ms.
[2025-05-31 07:41:34] [INFO ] Deduced a trap composed of 36 places in 366 ms of which 12 ms to minimize.
[2025-05-31 07:41:34] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 3 ms to minimize.
[2025-05-31 07:41:35] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 4 ms to minimize.
[2025-05-31 07:41:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 901 ms
[2025-05-31 07:41:35] [INFO ] Added : 32 causal constraints over 8 iterations in 1497 ms. Result :sat
Minimization took 288 ms.
[2025-05-31 07:41:35] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-05-31 07:41:36] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2025-05-31 07:41:36] [INFO ] [Real]Added 73 Read/Feed constraints in 62 ms returned sat
[2025-05-31 07:41:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 07:41:36] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2025-05-31 07:41:36] [INFO ] [Nat]Added 73 Read/Feed constraints in 139 ms returned sat
[2025-05-31 07:41:36] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 41 ms.
[2025-05-31 07:41:37] [INFO ] Added : 19 causal constraints over 4 iterations in 228 ms. Result :sat
Minimization took 209 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 539/539 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 536
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 533
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 533
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 196 transition count 521
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 196 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 196 transition count 518
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 194 transition count 512
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 194 transition count 512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 193 transition count 510
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 193 transition count 510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 192 transition count 507
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 192 transition count 507
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 191 transition count 505
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 191 transition count 505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 190 transition count 502
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 190 transition count 502
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 189 transition count 500
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 189 transition count 500
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 188 transition count 497
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 188 transition count 497
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 187 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 187 transition count 495
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 186 transition count 492
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 186 transition count 492
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 185 transition count 490
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 185 transition count 490
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 184 transition count 488
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 184 transition count 488
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 183 transition count 486
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 183 transition count 486
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 180 transition count 483
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 177 transition count 489
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 177 transition count 483
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 77 place count 177 transition count 474
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 177 transition count 478
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 85 place count 175 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 175 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 174 transition count 469
Applied a total of 90 rules in 377 ms. Remains 174 /205 variables (removed 31) and now considering 469/539 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 174/205 places, 469/539 transitions.
[2025-05-31 07:41:38] [INFO ] Flow matrix only has 433 transitions (discarded 36 similar events)
// Phase 1: matrix 433 rows 174 cols
[2025-05-31 07:41:38] [INFO ] Computed 10 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (32124 resets) in 2221 ms. (450 steps per ms)
FORMULA FireWire-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (27302 resets) in 2547 ms. (1569 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 07:41:42] [INFO ] Flow matrix only has 433 transitions (discarded 36 similar events)
[2025-05-31 07:41:42] [INFO ] Invariant cache hit.
[2025-05-31 07:41:42] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 07:41:43] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-05-31 07:41:43] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 07:41:43] [INFO ] [Real]Added 65 Read/Feed constraints in 19 ms returned sat
[2025-05-31 07:41:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 07:41:43] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2025-05-31 07:41:43] [INFO ] [Nat]Added 65 Read/Feed constraints in 59 ms returned sat
[2025-05-31 07:41:43] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 4 ms to minimize.
[2025-05-31 07:41:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2025-05-31 07:41:43] [INFO ] Computed and/alt/rep : 175/642/175 causal constraints (skipped 252 transitions) in 65 ms.
[2025-05-31 07:41:44] [INFO ] Added : 16 causal constraints over 4 iterations in 261 ms. Result :sat
Minimization took 369 ms.
[2025-05-31 07:41:44] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:41:44] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2025-05-31 07:41:44] [INFO ] [Real]Added 65 Read/Feed constraints in 44 ms returned sat
[2025-05-31 07:41:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 07:41:45] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2025-05-31 07:41:45] [INFO ] [Nat]Added 65 Read/Feed constraints in 70 ms returned sat
[2025-05-31 07:41:45] [INFO ] Computed and/alt/rep : 175/642/175 causal constraints (skipped 252 transitions) in 55 ms.
[2025-05-31 07:41:46] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 16 ms to minimize.
[2025-05-31 07:41:46] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 4 ms to minimize.
[2025-05-31 07:41:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 563 ms
[2025-05-31 07:41:46] [INFO ] Added : 41 causal constraints over 10 iterations in 1121 ms. Result :sat
Minimization took 324 ms.
[2025-05-31 07:41:46] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:41:47] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2025-05-31 07:41:47] [INFO ] [Real]Added 65 Read/Feed constraints in 169 ms returned sat
[2025-05-31 07:41:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 07:41:47] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2025-05-31 07:41:47] [INFO ] [Nat]Added 65 Read/Feed constraints in 106 ms returned sat
[2025-05-31 07:41:47] [INFO ] Computed and/alt/rep : 175/642/175 causal constraints (skipped 252 transitions) in 53 ms.
[2025-05-31 07:41:48] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2025-05-31 07:41:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2025-05-31 07:41:48] [INFO ] Added : 10 causal constraints over 2 iterations in 316 ms. Result :sat
Minimization took 289 ms.
[2025-05-31 07:41:48] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 07:41:48] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-31 07:41:48] [INFO ] [Real]Added 65 Read/Feed constraints in 31 ms returned sat
[2025-05-31 07:41:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 07:41:48] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2025-05-31 07:41:48] [INFO ] [Nat]Added 65 Read/Feed constraints in 64 ms returned sat
[2025-05-31 07:41:48] [INFO ] Computed and/alt/rep : 175/642/175 causal constraints (skipped 252 transitions) in 37 ms.
[2025-05-31 07:41:49] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 4 ms to minimize.
[2025-05-31 07:41:49] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 7 ms to minimize.
[2025-05-31 07:41:49] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 3 ms to minimize.
[2025-05-31 07:41:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 857 ms
[2025-05-31 07:41:50] [INFO ] Added : 38 causal constraints over 9 iterations in 1247 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 469/469 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 174 transition count 471
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 173 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 173 transition count 467
Applied a total of 6 rules in 84 ms. Remains 173 /174 variables (removed 1) and now considering 467/469 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 173/174 places, 467/469 transitions.
[2025-05-31 07:41:50] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
// Phase 1: matrix 430 rows 173 cols
[2025-05-31 07:41:50] [INFO ] Computed 10 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (32164 resets) in 2284 ms. (437 steps per ms)
BEST_FIRST walk for 4000003 steps (27511 resets) in 2431 ms. (1644 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 07:41:55] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:41:55] [INFO ] Invariant cache hit.
[2025-05-31 07:41:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 07:41:55] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-31 07:41:55] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 07:41:55] [INFO ] [Real]Added 65 Read/Feed constraints in 45 ms returned sat
[2025-05-31 07:41:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:41:56] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-05-31 07:41:56] [INFO ] [Nat]Added 65 Read/Feed constraints in 70 ms returned sat
[2025-05-31 07:41:56] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 2 ms to minimize.
[2025-05-31 07:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2025-05-31 07:41:56] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 55 ms.
[2025-05-31 07:41:56] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2025-05-31 07:41:57] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2025-05-31 07:41:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2025-05-31 07:41:57] [INFO ] Added : 28 causal constraints over 8 iterations in 751 ms. Result :sat
Minimization took 366 ms.
[2025-05-31 07:41:57] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:41:57] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2025-05-31 07:41:57] [INFO ] [Real]Added 65 Read/Feed constraints in 45 ms returned sat
[2025-05-31 07:41:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:41:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:41:58] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2025-05-31 07:41:58] [INFO ] [Nat]Added 65 Read/Feed constraints in 114 ms returned sat
[2025-05-31 07:41:58] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2025-05-31 07:41:58] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 3 ms to minimize.
[2025-05-31 07:41:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2025-05-31 07:41:58] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 56 ms.
[2025-05-31 07:41:59] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 8 ms to minimize.
[2025-05-31 07:41:59] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2025-05-31 07:41:59] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2025-05-31 07:41:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 570 ms
[2025-05-31 07:41:59] [INFO ] Added : 35 causal constraints over 7 iterations in 993 ms. Result :sat
Minimization took 313 ms.
[2025-05-31 07:42:00] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:42:00] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-31 07:42:00] [INFO ] [Real]Added 65 Read/Feed constraints in 35 ms returned sat
[2025-05-31 07:42:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:42:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 07:42:00] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-05-31 07:42:00] [INFO ] [Nat]Added 65 Read/Feed constraints in 67 ms returned sat
[2025-05-31 07:42:00] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 55 ms.
[2025-05-31 07:42:01] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2025-05-31 07:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-05-31 07:42:01] [INFO ] Added : 41 causal constraints over 9 iterations in 651 ms. Result :sat
Minimization took 355 ms.
[2025-05-31 07:42:02] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:42:02] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2025-05-31 07:42:02] [INFO ] [Real]Added 65 Read/Feed constraints in 59 ms returned sat
[2025-05-31 07:42:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:42:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 07:42:02] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-05-31 07:42:02] [INFO ] [Nat]Added 65 Read/Feed constraints in 130 ms returned sat
[2025-05-31 07:42:02] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 52 ms.
[2025-05-31 07:42:03] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 3 ms to minimize.
[2025-05-31 07:42:03] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-05-31 07:42:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 412 ms
[2025-05-31 07:42:03] [INFO ] Added : 26 causal constraints over 6 iterations in 772 ms. Result :sat
Minimization took 302 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 467/467 transitions.
Applied a total of 0 rules in 17 ms. Remains 173 /173 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 173/173 places, 467/467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 467/467 transitions.
Applied a total of 0 rules in 34 ms. Remains 173 /173 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2025-05-31 07:42:04] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:42:04] [INFO ] Invariant cache hit.
[2025-05-31 07:42:04] [INFO ] Implicit Places using invariants in 507 ms returned []
[2025-05-31 07:42:04] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:42:04] [INFO ] Invariant cache hit.
[2025-05-31 07:42:04] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 07:42:05] [INFO ] Implicit Places using invariants and state equation in 840 ms returned [18, 64, 121]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1359 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/173 places, 467/467 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1414 ms. Remains : 170/173 places, 467/467 transitions.
[2025-05-31 07:42:05] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
// Phase 1: matrix 430 rows 170 cols
[2025-05-31 07:42:05] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (32003 resets) in 2368 ms. (422 steps per ms)
BEST_FIRST walk for 4000003 steps (27506 resets) in 2389 ms. (1673 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 07:42:10] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:42:10] [INFO ] Invariant cache hit.
[2025-05-31 07:42:10] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:42:10] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-05-31 07:42:10] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 07:42:10] [INFO ] [Real]Added 65 Read/Feed constraints in 87 ms returned sat
[2025-05-31 07:42:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:42:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:42:10] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2025-05-31 07:42:10] [INFO ] [Nat]Added 65 Read/Feed constraints in 66 ms returned sat
[2025-05-31 07:42:11] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2025-05-31 07:42:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2025-05-31 07:42:11] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 54 ms.
[2025-05-31 07:42:11] [INFO ] Added : 19 causal constraints over 4 iterations in 259 ms. Result :sat
Minimization took 380 ms.
[2025-05-31 07:42:11] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:42:12] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2025-05-31 07:42:12] [INFO ] [Real]Added 65 Read/Feed constraints in 41 ms returned sat
[2025-05-31 07:42:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:42:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:42:12] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-05-31 07:42:12] [INFO ] [Nat]Added 65 Read/Feed constraints in 68 ms returned sat
[2025-05-31 07:42:12] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2025-05-31 07:42:12] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2025-05-31 07:42:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2025-05-31 07:42:12] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 66 ms.
[2025-05-31 07:42:13] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 3 ms to minimize.
[2025-05-31 07:42:13] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2025-05-31 07:42:13] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 3 ms to minimize.
[2025-05-31 07:42:13] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2025-05-31 07:42:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 854 ms
[2025-05-31 07:42:14] [INFO ] Added : 43 causal constraints over 10 iterations in 1420 ms. Result :sat
Minimization took 367 ms.
[2025-05-31 07:42:14] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:42:14] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-05-31 07:42:14] [INFO ] [Real]Added 65 Read/Feed constraints in 36 ms returned sat
[2025-05-31 07:42:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:42:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-31 07:42:15] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2025-05-31 07:42:15] [INFO ] [Nat]Added 65 Read/Feed constraints in 97 ms returned sat
[2025-05-31 07:42:15] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2025-05-31 07:42:15] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 2 ms to minimize.
[2025-05-31 07:42:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 470 ms
[2025-05-31 07:42:15] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 53 ms.
[2025-05-31 07:42:16] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2025-05-31 07:42:16] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 3 ms to minimize.
[2025-05-31 07:42:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2025-05-31 07:42:16] [INFO ] Added : 45 causal constraints over 10 iterations in 864 ms. Result :sat
Minimization took 375 ms.
[2025-05-31 07:42:17] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:42:17] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2025-05-31 07:42:17] [INFO ] [Real]Added 65 Read/Feed constraints in 38 ms returned sat
[2025-05-31 07:42:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:42:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:42:17] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-05-31 07:42:17] [INFO ] [Nat]Added 65 Read/Feed constraints in 70 ms returned sat
[2025-05-31 07:42:17] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 56 ms.
[2025-05-31 07:42:18] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 3 ms to minimize.
[2025-05-31 07:42:18] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2025-05-31 07:42:18] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 3 ms to minimize.
[2025-05-31 07:42:18] [INFO ] Deduced a trap composed of 62 places in 162 ms of which 3 ms to minimize.
[2025-05-31 07:42:18] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2025-05-31 07:42:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 889 ms
[2025-05-31 07:42:19] [INFO ] Added : 38 causal constraints over 9 iterations in 1353 ms. Result :sat
Minimization took 283 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 170/170 places, 467/467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2025-05-31 07:42:19] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:42:19] [INFO ] Invariant cache hit.
[2025-05-31 07:42:19] [INFO ] Implicit Places using invariants in 275 ms returned []
[2025-05-31 07:42:19] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:42:19] [INFO ] Invariant cache hit.
[2025-05-31 07:42:20] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 07:42:20] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2025-05-31 07:42:20] [INFO ] Redundant transitions in 47 ms returned []
Running 461 sub problems to find dead transitions.
[2025-05-31 07:42:20] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:42:20] [INFO ] Invariant cache hit.
[2025-05-31 07:42:20] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2025-05-31 07:42:26] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 3 ms to minimize.
[2025-05-31 07:42:26] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2025-05-31 07:42:26] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 2 ms to minimize.
[2025-05-31 07:42:26] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-05-31 07:42:26] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 3 ms to minimize.
[2025-05-31 07:42:28] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 3 ms to minimize.
[2025-05-31 07:42:28] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 3 ms to minimize.
[2025-05-31 07:42:28] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2025-05-31 07:42:29] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2025-05-31 07:42:31] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2025-05-31 07:42:31] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 3 ms to minimize.
[2025-05-31 07:42:33] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2025-05-31 07:42:39] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (OVERLAPS) 430/600 variables, 170/190 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 65/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/600 variables, and 255 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 430/600 variables, 170/190 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 65/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 461/716 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2025-05-31 07:43:05] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2025-05-31 07:43:13] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2025-05-31 07:43:14] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 3/719 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 719 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 16/16 constraints]
After SMT, in 61095ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 61133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62358 ms. Remains : 170/170 places, 467/467 transitions.
RANDOM walk for 40000 steps (1277 resets) in 1905 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (276 resets) in 271 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (281 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (270 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (279 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (273 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (292 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
[2025-05-31 07:43:22] [INFO ] Flatten gal took : 405 ms
BEST_FIRST walk for 40004 steps (285 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (273 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
[2025-05-31 07:43:23] [INFO ] Flatten gal took : 257 ms
[2025-05-31 07:43:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6153570759080443296.gal : 109 ms
[2025-05-31 07:43:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5469357749667403049.prop : 7 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/ReachabilityCardinality6153570759080443296.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5469357749667403049.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5469357749667403049.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :33 after 63
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :63 after 97
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :97 after 127
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :127 after 195
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :195 after 489
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :489 after 4236
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :4236 after 14448
Interrupted probabilistic random walk after 241435 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 8
Probabilistic random walk after 241435 steps, saw 73187 distinct states, run finished after 3015 ms. (steps per millisecond=80 ) properties seen :0
[2025-05-31 07:43:25] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:43:25] [INFO ] Invariant cache hit.
[2025-05-31 07:43:25] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 293/394 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/509 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/510 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 81/591 variables, 41/214 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 8/599 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/599 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/599 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 1/600 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/600 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/600 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 242 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 293/394 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/509 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-31 07:43:28] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :14448 after 27058
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/510 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 81/591 variables, 41/223 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/591 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 8/599 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/599 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/599 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 1/600 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/600 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/600 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 251 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 3369ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1146 ms.
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 170/170 places, 467/467 transitions.
RANDOM walk for 40000 steps (1225 resets) in 310 ms. (128 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (253 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (255 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (265 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (262 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (274 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (273 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (262 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (271 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :27058 after 139091
Interrupted probabilistic random walk after 289458 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 8
Probabilistic random walk after 289458 steps, saw 85966 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-05-31 07:43:34] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:43:34] [INFO ] Invariant cache hit.
[2025-05-31 07:43:34] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 293/394 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/509 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/510 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 81/591 variables, 41/214 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 8/599 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/599 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/599 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 1/600 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/600 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/600 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 242 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1552 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 293/394 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 115/509 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-31 07:43:36] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/510 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 81/591 variables, 41/223 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/591 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 8/599 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/599 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/599 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 1/600 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/600 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/600 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 251 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1819 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 3388ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 897 ms.
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 170/170 places, 467/467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 467/467 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2025-05-31 07:43:38] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:43:38] [INFO ] Invariant cache hit.
[2025-05-31 07:43:38] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-05-31 07:43:38] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:43:38] [INFO ] Invariant cache hit.
[2025-05-31 07:43:39] [INFO ] State equation strengthened by 65 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :139091 after 669647
[2025-05-31 07:43:39] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
[2025-05-31 07:43:39] [INFO ] Redundant transitions in 5 ms returned []
Running 461 sub problems to find dead transitions.
[2025-05-31 07:43:39] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:43:39] [INFO ] Invariant cache hit.
[2025-05-31 07:43:39] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2025-05-31 07:43:44] [INFO ] Deduced a trap composed of 64 places in 359 ms of which 13 ms to minimize.
[2025-05-31 07:43:44] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 07:43:44] [INFO ] Deduced a trap composed of 61 places in 278 ms of which 3 ms to minimize.
[2025-05-31 07:43:44] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2025-05-31 07:43:44] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 5 ms to minimize.
[2025-05-31 07:43:45] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 10 ms to minimize.
[2025-05-31 07:43:46] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 2 ms to minimize.
[2025-05-31 07:43:46] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2025-05-31 07:43:46] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 8 ms to minimize.
[2025-05-31 07:43:48] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2025-05-31 07:43:49] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2025-05-31 07:43:50] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 461 unsolved
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :669647 after 2.32702e+06
[2025-05-31 07:43:55] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (OVERLAPS) 430/600 variables, 170/190 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 65/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/600 variables, and 255 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Detected timeout of ITS tools.
[2025-05-31 07:44:13] [INFO ] Flatten gal took : 52 ms
[2025-05-31 07:44:13] [INFO ] Applying decomposition
[2025-05-31 07:44:13] [INFO ] Flatten gal took : 52 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/graph8692442869395543025.txt' '-o' '/tmp/graph8692442869395543025.bin' '-w' '/tmp/graph8692442869395543025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8692442869395543025.bin' '-l' '-1' '-v' '-w' '/tmp/graph8692442869395543025.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:44:14] [INFO ] Decomposing Gal with order
[2025-05-31 07:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:44:14] [INFO ] Removed a total of 735 redundant transitions.
[2025-05-31 07:44:14] [INFO ] Flatten gal took : 155 ms
[2025-05-31 07:44:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 56 ms.
[2025-05-31 07:44:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1484326046427583558.gal : 12 ms
[2025-05-31 07:44:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13441088730217331003.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/ReachabilityCardinality1484326046427583558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13441088730217331003.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13441088730217331003.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :3 after 15
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :15 after 10934
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 430/600 variables, 170/190 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 65/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :10934 after 128735
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :128735 after 426527
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 461/716 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2025-05-31 07:44:25] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2025-05-31 07:44:34] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2025-05-31 07:44:35] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 3/719 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 719 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 16/16 constraints]
After SMT, in 60871ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60883ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62147 ms. Remains : 170/170 places, 467/467 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 142 edges and 170 vertex of which 29 / 170 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 144 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 144 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 143 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 143 transition count 311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 142 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 141 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 141 transition count 260
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 141 transition count 245
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 132 transition count 242
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 132 transition count 242
Applied a total of 46 rules in 89 ms. Remains 132 /170 variables (removed 38) and now considering 242/467 (removed 225) transitions.
Running SMT prover for 8 properties.
[2025-05-31 07:44:40] [INFO ] Flow matrix only has 240 transitions (discarded 2 similar events)
// Phase 1: matrix 240 rows 132 cols
[2025-05-31 07:44:40] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 07:44:40] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 07:44:40] [INFO ] After 165ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:2
TRAPS : Iteration 0
[2025-05-31 07:44:40] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-05-31 07:44:41] [INFO ] After 324ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2025-05-31 07:44:41] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2025-05-31 07:44:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 07:44:41] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2025-05-31 07:44:41] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2025-05-31 07:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
TRAPS : Iteration 1
[2025-05-31 07:44:41] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 17 ms to minimize.
[2025-05-31 07:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
TRAPS : Iteration 2
[2025-05-31 07:44:41] [INFO ] After 818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-05-31 07:44:42] [INFO ] After 1017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2025-05-31 07:44:42] [INFO ] Flatten gal took : 39 ms
[2025-05-31 07:44:42] [INFO ] Flatten gal took : 32 ms
[2025-05-31 07:44:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6668532819498806222.gal : 20 ms
[2025-05-31 07:44:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7391588112347692217.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6668532819498806222.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7391588112347692217.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7391588112347692217.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 21
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :21 after 73
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :73 after 136
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :136 after 224
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :224 after 409
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :409 after 1622
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1622 after 11323
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :11323 after 341597
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :341597 after 472384
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :472384 after 2.39213e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.8281e+07,2.05404,33104,2,2598,20,84793,8,0,772,112353,0
Total reachable state count : 28280970
Verifying 8 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,133808,2.05614,33104,2,1193,20,84793,8,0,774,112353,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,133808,2.05733,33104,2,1193,20,84793,8,0,774,112353,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,114,2.05849,33104,2,247,20,84793,9,0,776,112353,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,114,2.05981,33104,2,247,20,84793,10,0,777,112353,0
Reachability property MAX2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,114,2.06102,33104,2,247,20,84793,11,0,779,112353,0
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,114,2.06232,33104,2,247,20,84793,12,0,780,112353,0
Reachability property MAX3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,185,2.06375,33104,2,247,20,84793,13,0,782,112353,0
Invariant property MIN3 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,185,2.06503,33104,2,247,20,84793,14,0,783,112353,0
Over-approximation ignoring read arcs solved 0 properties in 3759 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Starting property specific reduction for FireWire-PT-14-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:44:44] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
// Phase 1: matrix 430 rows 170 cols
[2025-05-31 07:44:44] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (315 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (60 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:44:44] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:44:44] [INFO ] Invariant cache hit.
[2025-05-31 07:44:44] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-31 07:44:44] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2025-05-31 07:44:44] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 07:44:44] [INFO ] [Real]Added 65 Read/Feed constraints in 88 ms returned sat
[2025-05-31 07:44:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:44:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-31 07:44:45] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2025-05-31 07:44:45] [INFO ] [Nat]Added 65 Read/Feed constraints in 77 ms returned sat
[2025-05-31 07:44:45] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-05-31 07:44:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-05-31 07:44:45] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 48 ms.
[2025-05-31 07:44:45] [INFO ] Added : 19 causal constraints over 4 iterations in 234 ms. Result :sat
Minimization took 383 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 170 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p153) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 464/464 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 168 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 168 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 167 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 167 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 166 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 166 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 165 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 165 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 164 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 164 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 163 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 163 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 162 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 162 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 161 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 161 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 160 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 160 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 159 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 159 transition count 438
Applied a total of 22 rules in 55 ms. Remains 159 /170 variables (removed 11) and now considering 438/464 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 159/170 places, 438/464 transitions.
[2025-05-31 07:44:45] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
// Phase 1: matrix 401 rows 159 cols
[2025-05-31 07:44:45] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32019 resets) in 2331 ms. (428 steps per ms)
BEST_FIRST walk for 1000001 steps (6766 resets) in 638 ms. (1564 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:44:48] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 07:44:48] [INFO ] Invariant cache hit.
[2025-05-31 07:44:49] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-31 07:44:49] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2025-05-31 07:44:49] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 07:44:49] [INFO ] [Real]Added 60 Read/Feed constraints in 30 ms returned sat
[2025-05-31 07:44:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:44:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:44:49] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-05-31 07:44:49] [INFO ] [Nat]Added 60 Read/Feed constraints in 27 ms returned sat
[2025-05-31 07:44:49] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 2 ms to minimize.
[2025-05-31 07:44:49] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 3 ms to minimize.
[2025-05-31 07:44:50] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 3 ms to minimize.
[2025-05-31 07:44:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 618 ms
[2025-05-31 07:44:50] [INFO ] Computed and/alt/rep : 163/596/163 causal constraints (skipped 232 transitions) in 49 ms.
[2025-05-31 07:44:50] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2025-05-31 07:44:50] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2025-05-31 07:44:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2025-05-31 07:44:50] [INFO ] Added : 55 causal constraints over 13 iterations in 654 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 159/159 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2025-05-31 07:44:51] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 07:44:51] [INFO ] Invariant cache hit.
[2025-05-31 07:44:51] [INFO ] Implicit Places using invariants in 323 ms returned []
[2025-05-31 07:44:51] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 07:44:51] [INFO ] Invariant cache hit.
[2025-05-31 07:44:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 07:44:52] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2025-05-31 07:44:52] [INFO ] Redundant transitions in 4 ms returned []
Running 432 sub problems to find dead transitions.
[2025-05-31 07:44:52] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 07:44:52] [INFO ] Invariant cache hit.
[2025-05-31 07:44:52] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:44:55] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2025-05-31 07:44:56] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:45:01] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2025-05-31 07:45:01] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 3 ms to minimize.
[2025-05-31 07:45:01] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 2 ms to minimize.
[2025-05-31 07:45:02] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 2 ms to minimize.
[2025-05-31 07:45:02] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2025-05-31 07:45:04] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2025-05-31 07:45:04] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:45:07] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:45:08] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:45:13] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 9 (OVERLAPS) 401/560 variables, 159/178 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/560 variables, and 238 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (OVERLAPS) 401/560 variables, 159/178 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 432/670 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:45:39] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2025-05-31 07:45:50] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2025-05-31 07:45:50] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 3/673 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/560 variables, and 673 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 15/15 constraints]
After SMT, in 60577ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61517 ms. Remains : 159/159 places, 438/438 transitions.
[2025-05-31 07:45:52] [INFO ] Flatten gal took : 84 ms
RANDOM walk for 40000 steps (1310 resets) in 442 ms. (90 steps per ms) remains 2/2 properties
[2025-05-31 07:45:52] [INFO ] Flatten gal took : 71 ms
BEST_FIRST walk for 40004 steps (285 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
[2025-05-31 07:45:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7927134315120277400.gal : 21 ms
[2025-05-31 07:45:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8934293527505401594.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/ReachabilityCardinality7927134315120277400.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8934293527505401594.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (268 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8934293527505401594.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 97
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :97 after 128
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :128 after 196
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :196 after 479
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :479 after 3700
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3700 after 14060
Interrupted probabilistic random walk after 445232 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 2
Probabilistic random walk after 445232 steps, saw 132305 distinct states, run finished after 3002 ms. (steps per millisecond=148 ) properties seen :0
[2025-05-31 07:45:55] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 07:45:55] [INFO ] Invariant cache hit.
[2025-05-31 07:45:55] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/196 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/382 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/542 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 38/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/558 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/558 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/560 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/560 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/560 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/196 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/382 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/542 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 38/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/558 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/558 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/558 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/560 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/560 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/560 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 912ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 159/159 places, 438/438 transitions.
RANDOM walk for 40000 steps (1329 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (255 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (274 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14060 after 26725
Interrupted probabilistic random walk after 408321 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 2
Probabilistic random walk after 408321 steps, saw 121696 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2025-05-31 07:45:59] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 07:45:59] [INFO ] Invariant cache hit.
[2025-05-31 07:45:59] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/196 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/382 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/542 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 38/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/558 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/558 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/560 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/560 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/560 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 145/196 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/382 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/542 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 38/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/558 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/558 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/558 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/560 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/560 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/560 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 857ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 159/159 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 438/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2025-05-31 07:46:00] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 07:46:00] [INFO ] Invariant cache hit.
[2025-05-31 07:46:00] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-05-31 07:46:00] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 07:46:00] [INFO ] Invariant cache hit.
[2025-05-31 07:46:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 07:46:01] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2025-05-31 07:46:01] [INFO ] Redundant transitions in 3 ms returned []
Running 432 sub problems to find dead transitions.
[2025-05-31 07:46:01] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 07:46:01] [INFO ] Invariant cache hit.
[2025-05-31 07:46:01] [INFO ] State equation strengthened by 60 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :26725 after 133155
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:46:06] [INFO ] Deduced a trap composed of 32 places in 681 ms of which 2 ms to minimize.
[2025-05-31 07:46:06] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:46:11] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2025-05-31 07:46:11] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 2 ms to minimize.
[2025-05-31 07:46:12] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2025-05-31 07:46:12] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :133155 after 583184
[2025-05-31 07:46:13] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2025-05-31 07:46:14] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2025-05-31 07:46:14] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:46:17] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:46:18] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:46:23] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 9 (OVERLAPS) 401/560 variables, 159/178 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:46:31] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/560 variables, and 239 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :583184 after 1.76753e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (OVERLAPS) 401/560 variables, 159/179 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Detected timeout of ITS tools.
[2025-05-31 07:46:42] [INFO ] Flatten gal took : 40 ms
[2025-05-31 07:46:42] [INFO ] Applying decomposition
[2025-05-31 07:46:43] [INFO ] Flatten gal took : 55 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/graph1354396874236138738.txt' '-o' '/tmp/graph1354396874236138738.bin' '-w' '/tmp/graph1354396874236138738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1354396874236138738.bin' '-l' '-1' '-v' '-w' '/tmp/graph1354396874236138738.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:46:43] [INFO ] Decomposing Gal with order
[2025-05-31 07:46:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:46:43] [INFO ] Removed a total of 702 redundant transitions.
[2025-05-31 07:46:43] [INFO ] Flatten gal took : 59 ms
[2025-05-31 07:46:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 19 ms.
[2025-05-31 07:46:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12086995049728667031.gal : 11 ms
[2025-05-31 07:46:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10324476051335093620.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/ReachabilityCardinality12086995049728667031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10324476051335093620.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10324476051335093620.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7 after 11476
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :11476 after 298870
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 432/671 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 07:46:56] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2025-05-31 07:46:56] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/560 variables, and 673 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 15/15 constraints]
After SMT, in 60518ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60524ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61339 ms. Remains : 159/159 places, 438/438 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 130 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 237
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 130 transition count 222
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 121 transition count 219
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 121 transition count 219
Applied a total of 46 rules in 38 ms. Remains 121 /159 variables (removed 38) and now considering 219/438 (removed 219) transitions.
Running SMT prover for 2 properties.
[2025-05-31 07:47:02] [INFO ] Flow matrix only has 217 transitions (discarded 2 similar events)
// Phase 1: matrix 217 rows 121 cols
[2025-05-31 07:47:02] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 07:47:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 07:47:02] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 07:47:02] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2025-05-31 07:47:02] [INFO ] After 203ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 07:47:02] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 07:47:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:47:02] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 07:47:02] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2025-05-31 07:47:02] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2025-05-31 07:47:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
TRAPS : Iteration 1
[2025-05-31 07:47:02] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 07:47:02] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 07:47:02] [INFO ] Flatten gal took : 13 ms
[2025-05-31 07:47:02] [INFO ] Flatten gal took : 12 ms
[2025-05-31 07:47:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16880526756782448429.gal : 4 ms
[2025-05-31 07:47:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11016541104533441913.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/ReachabilityCardinality16880526756782448429.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11016541104533441913.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/ReachabilityCardinality11016541104533441913.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 21
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :21 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 153
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :153 after 242
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :242 after 431
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :431 after 3866
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3866 after 11323
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :11323 after 307615
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :307615 after 735173
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.68965e+07 after 1.77401e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.81262e+07,1.99801,35804,2,2786,18,96694,8,0,702,126446,0
Total reachable state count : 28126193
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,11147,2.00496,35804,2,495,18,96694,8,0,704,126446,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,11147,2.00694,35804,2,495,18,96694,8,0,704,126446,0
Over-approximation ignoring read arcs solved 0 properties in 2717 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-14-UpperBounds-00 in 140510 ms.
Starting property specific reduction for FireWire-PT-14-UpperBounds-03
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:47:04] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
// Phase 1: matrix 430 rows 170 cols
[2025-05-31 07:47:04] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (306 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (69 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:47:04] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:47:04] [INFO ] Invariant cache hit.
[2025-05-31 07:47:04] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:47:05] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-05-31 07:47:05] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 07:47:05] [INFO ] [Real]Added 65 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:47:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:47:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:47:05] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2025-05-31 07:47:05] [INFO ] [Nat]Added 65 Read/Feed constraints in 46 ms returned sat
[2025-05-31 07:47:05] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2025-05-31 07:47:05] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-05-31 07:47:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2025-05-31 07:47:05] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 38 ms.
[2025-05-31 07:47:06] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2025-05-31 07:47:06] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-05-31 07:47:06] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 3 ms to minimize.
[2025-05-31 07:47:06] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2025-05-31 07:47:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 528 ms
[2025-05-31 07:47:06] [INFO ] Added : 43 causal constraints over 10 iterations in 919 ms. Result :sat
Minimization took 312 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 170 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p93) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 464/464 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 169 transition count 462
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 168 transition count 459
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 167 transition count 457
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 4 place count 166 transition count 454
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 166 transition count 454
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 165 transition count 452
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 165 transition count 452
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 164 transition count 449
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 164 transition count 449
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 163 transition count 447
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 163 transition count 447
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 162 transition count 444
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 162 transition count 444
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 161 transition count 442
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 161 transition count 442
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 160 transition count 439
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 160 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 159 transition count 437
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 159 transition count 437
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 158 transition count 434
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 158 transition count 434
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 157 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 157 transition count 432
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 156 transition count 430
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 156 transition count 430
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 155 transition count 428
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 155 transition count 428
Applied a total of 27 rules in 57 ms. Remains 155 /170 variables (removed 15) and now considering 428/464 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 155/170 places, 428/464 transitions.
[2025-05-31 07:47:06] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
// Phase 1: matrix 391 rows 155 cols
[2025-05-31 07:47:06] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32004 resets) in 1978 ms. (505 steps per ms)
BEST_FIRST walk for 1000001 steps (6823 resets) in 622 ms. (1605 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:47:09] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 07:47:09] [INFO ] Invariant cache hit.
[2025-05-31 07:47:09] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:47:09] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-05-31 07:47:09] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 07:47:09] [INFO ] [Real]Added 58 Read/Feed constraints in 24 ms returned sat
[2025-05-31 07:47:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:47:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:47:09] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-31 07:47:09] [INFO ] [Nat]Added 58 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:47:10] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 2 ms to minimize.
[2025-05-31 07:47:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2025-05-31 07:47:10] [INFO ] Computed and/alt/rep : 159/584/159 causal constraints (skipped 226 transitions) in 32 ms.
[2025-05-31 07:47:10] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2025-05-31 07:47:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2025-05-31 07:47:10] [INFO ] Added : 17 causal constraints over 4 iterations in 253 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 428/428 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 428/428 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 428/428 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2025-05-31 07:47:10] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 07:47:10] [INFO ] Invariant cache hit.
[2025-05-31 07:47:10] [INFO ] Implicit Places using invariants in 310 ms returned []
[2025-05-31 07:47:10] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 07:47:10] [INFO ] Invariant cache hit.
[2025-05-31 07:47:11] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 07:47:11] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2025-05-31 07:47:11] [INFO ] Redundant transitions in 3 ms returned []
Running 422 sub problems to find dead transitions.
[2025-05-31 07:47:11] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 07:47:11] [INFO ] Invariant cache hit.
[2025-05-31 07:47:11] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 07:47:14] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2025-05-31 07:47:15] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 1/155 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 07:47:21] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2025-05-31 07:47:21] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 2 ms to minimize.
[2025-05-31 07:47:21] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 2 ms to minimize.
[2025-05-31 07:47:21] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2025-05-31 07:47:22] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2025-05-31 07:47:22] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 2 ms to minimize.
[2025-05-31 07:47:22] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2025-05-31 07:47:23] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
[2025-05-31 07:47:23] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2025-05-31 07:47:24] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 391/546 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/232 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 07:47:40] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/546 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 233 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 1/155 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 391/546 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/233 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 422/655 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 07:48:00] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 656 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 14/14 constraints]
After SMT, in 60471ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61379 ms. Remains : 155/155 places, 428/428 transitions.
RANDOM walk for 40000 steps (1273 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
[2025-05-31 07:48:12] [INFO ] Flatten gal took : 101 ms
BEST_FIRST walk for 40004 steps (276 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
[2025-05-31 07:48:12] [INFO ] Flatten gal took : 21 ms
[2025-05-31 07:48:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7462131685748239099.gal : 6 ms
[2025-05-31 07:48:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4036074327890526280.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/ReachabilityCardinality7462131685748239099.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4036074327890526280.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (272 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4036074327890526280.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 97
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :97 after 127
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :127 after 195
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :195 after 493
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :493 after 4148
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4148 after 15450
Interrupted probabilistic random walk after 404453 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 2
Probabilistic random walk after 404453 steps, saw 120346 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2025-05-31 07:48:15] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 07:48:15] [INFO ] Invariant cache hit.
[2025-05-31 07:48:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/182 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/368 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/369 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/528 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 38/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/544 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/546 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/546 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/182 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/368 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/369 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/528 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/544 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/546 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1061ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 428/428 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 155/155 places, 428/428 transitions.
RANDOM walk for 40000 steps (1260 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (261 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (274 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :15450 after 20039
Interrupted probabilistic random walk after 417060 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 2
Probabilistic random walk after 417060 steps, saw 124646 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2025-05-31 07:48:19] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 07:48:19] [INFO ] Invariant cache hit.
[2025-05-31 07:48:19] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/182 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/368 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/369 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/528 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 38/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/544 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/546 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/546 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/182 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/368 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/369 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/528 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/544 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/544 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/546 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 428/428 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 155/155 places, 428/428 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 428/428 transitions.
Applied a total of 0 rules in 19 ms. Remains 155 /155 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2025-05-31 07:48:20] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 07:48:20] [INFO ] Invariant cache hit.
[2025-05-31 07:48:20] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-31 07:48:20] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 07:48:20] [INFO ] Invariant cache hit.
[2025-05-31 07:48:20] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 07:48:20] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2025-05-31 07:48:20] [INFO ] Redundant transitions in 3 ms returned []
Running 422 sub problems to find dead transitions.
[2025-05-31 07:48:20] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 07:48:20] [INFO ] Invariant cache hit.
[2025-05-31 07:48:20] [INFO ] State equation strengthened by 58 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :20039 after 130732
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 07:48:23] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2025-05-31 07:48:24] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 1/155 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 07:48:30] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :130732 after 688209
[2025-05-31 07:48:30] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2025-05-31 07:48:30] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 2 ms to minimize.
[2025-05-31 07:48:30] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 2 ms to minimize.
[2025-05-31 07:48:31] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 2 ms to minimize.
[2025-05-31 07:48:31] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 2 ms to minimize.
[2025-05-31 07:48:31] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2025-05-31 07:48:32] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 2 ms to minimize.
[2025-05-31 07:48:32] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-05-31 07:48:33] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 391/546 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/232 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 422 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :688209 after 2.04361e+06
[2025-05-31 07:48:49] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.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 1.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 1.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 1.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/546 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 233 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 1/155 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 391/546 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 58/233 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Detected timeout of ITS tools.
[2025-05-31 07:49:02] [INFO ] Flatten gal took : 19 ms
[2025-05-31 07:49:02] [INFO ] Applying decomposition
[2025-05-31 07:49:02] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3438101230407166301.txt' '-o' '/tmp/graph3438101230407166301.bin' '-w' '/tmp/graph3438101230407166301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3438101230407166301.bin' '-l' '-1' '-v' '-w' '/tmp/graph3438101230407166301.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:49:02] [INFO ] Decomposing Gal with order
[2025-05-31 07:49:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:49:02] [INFO ] Removed a total of 682 redundant transitions.
[2025-05-31 07:49:02] [INFO ] Flatten gal took : 43 ms
[2025-05-31 07:49:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 16 ms.
[2025-05-31 07:49:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10812339432293975746.gal : 6 ms
[2025-05-31 07:49:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality915048220728248285.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/ReachabilityCardinality10812339432293975746.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality915048220728248285.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality915048220728248285.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 27
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :27 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 465
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :465 after 870
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :870 after 1365
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 422/655 constraints. Problems are: Problem set: 0 solved, 422 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1365 after 95302
[2025-05-31 07:49:10] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 656 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 14/14 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60464ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61182 ms. Remains : 155/155 places, 428/428 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 138 edges and 155 vertex of which 29 / 155 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 129 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 128 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 128 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 127 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 126 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 126 transition count 229
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 126 transition count 214
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 117 transition count 211
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 117 transition count 211
Applied a total of 46 rules in 44 ms. Remains 117 /155 variables (removed 38) and now considering 211/428 (removed 217) transitions.
Running SMT prover for 2 properties.
[2025-05-31 07:49:21] [INFO ] Flow matrix only has 209 transitions (discarded 2 similar events)
// Phase 1: matrix 209 rows 117 cols
[2025-05-31 07:49:21] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 07:49:21] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:49:21] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 07:49:21] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2025-05-31 07:49:21] [INFO ] After 178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 07:49:21] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 07:49:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 07:49:21] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 07:49:21] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2025-05-31 07:49:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
TRAPS : Iteration 1
[2025-05-31 07:49:21] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 07:49:21] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 07:49:21] [INFO ] Flatten gal took : 10 ms
[2025-05-31 07:49:21] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:49:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8949443396037209134.gal : 4 ms
[2025-05-31 07:49:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11047790017701117779.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/ReachabilityCardinality8949443396037209134.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11047790017701117779.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/ReachabilityCardinality11047790017701117779.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 21
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :21 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 150
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :150 after 262
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :262 after 451
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :451 after 1847
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1847 after 9588
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,124726,0.443378,13504,2,1230,15,27736,6,0,676,34486,0
Total reachable state count : 124726
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,177,0.444545,13504,2,217,15,27736,7,0,679,34486,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,177,0.445181,13504,2,217,15,27736,8,0,680,34486,0
Over-approximation ignoring read arcs solved 0 properties in 1053 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-14-UpperBounds-03 in 137644 ms.
Starting property specific reduction for FireWire-PT-14-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:49:22] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
// Phase 1: matrix 430 rows 170 cols
[2025-05-31 07:49:22] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (318 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (75 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:49:22] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:49:22] [INFO ] Invariant cache hit.
[2025-05-31 07:49:22] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:49:22] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-05-31 07:49:22] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 07:49:22] [INFO ] [Real]Added 65 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:49:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:49:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:49:23] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-05-31 07:49:23] [INFO ] [Nat]Added 65 Read/Feed constraints in 68 ms returned sat
[2025-05-31 07:49:23] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2025-05-31 07:49:23] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
[2025-05-31 07:49:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2025-05-31 07:49:23] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 37 ms.
[2025-05-31 07:49:23] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2025-05-31 07:49:23] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-05-31 07:49:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2025-05-31 07:49:24] [INFO ] Added : 45 causal constraints over 10 iterations in 615 ms. Result :sat
Minimization took 308 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 170 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p91) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 464/464 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 169 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 168 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 168 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 167 transition count 457
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 167 transition count 457
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 166 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 166 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 165 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 165 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 164 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 164 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 163 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 163 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 162 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 162 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 161 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 161 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 160 transition count 439
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 160 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 159 transition count 437
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 159 transition count 437
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 158 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 158 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 157 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 157 transition count 433
Applied a total of 25 rules in 44 ms. Remains 157 /170 variables (removed 13) and now considering 433/464 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 157/170 places, 433/464 transitions.
[2025-05-31 07:49:24] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
// Phase 1: matrix 396 rows 157 cols
[2025-05-31 07:49:24] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32180 resets) in 1941 ms. (514 steps per ms)
BEST_FIRST walk for 1000001 steps (6972 resets) in 602 ms. (1658 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:49:27] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 07:49:27] [INFO ] Invariant cache hit.
[2025-05-31 07:49:27] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:49:27] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-05-31 07:49:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 07:49:27] [INFO ] [Real]Added 59 Read/Feed constraints in 42 ms returned sat
[2025-05-31 07:49:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:49:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:49:27] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-05-31 07:49:27] [INFO ] [Nat]Added 59 Read/Feed constraints in 38 ms returned sat
[2025-05-31 07:49:27] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2025-05-31 07:49:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2025-05-31 07:49:27] [INFO ] Computed and/alt/rep : 161/590/161 causal constraints (skipped 229 transitions) in 32 ms.
[2025-05-31 07:49:28] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
[2025-05-31 07:49:28] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2025-05-31 07:49:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2025-05-31 07:49:28] [INFO ] Added : 39 causal constraints over 9 iterations in 565 ms. Result :sat
Minimization took 209 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 433/433 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 157/157 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 433/433 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2025-05-31 07:49:28] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 07:49:28] [INFO ] Invariant cache hit.
[2025-05-31 07:49:28] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-05-31 07:49:28] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 07:49:28] [INFO ] Invariant cache hit.
[2025-05-31 07:49:28] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 07:49:29] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2025-05-31 07:49:29] [INFO ] Redundant transitions in 3 ms returned []
Running 427 sub problems to find dead transitions.
[2025-05-31 07:49:29] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 07:49:29] [INFO ] Invariant cache hit.
[2025-05-31 07:49:29] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 07:49:32] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2025-05-31 07:49:32] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 07:49:38] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 3 ms to minimize.
[2025-05-31 07:49:38] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2025-05-31 07:49:38] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 2 ms to minimize.
[2025-05-31 07:49:39] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2025-05-31 07:49:39] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 2 ms to minimize.
[2025-05-31 07:49:41] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2025-05-31 07:49:41] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (OVERLAPS) 396/553 variables, 157/173 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/232 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 07:49:52] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 07:49:58] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 234 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (OVERLAPS) 396/553 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 427/661 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 07:50:19] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 07:50:26] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 663 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 13/13 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60483ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61252 ms. Remains : 157/157 places, 433/433 transitions.
[2025-05-31 07:50:29] [INFO ] Flatten gal took : 34 ms
[2025-05-31 07:50:29] [INFO ] Flatten gal took : 16 ms
[2025-05-31 07:50:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5430107744960859889.gal : 5 ms
[2025-05-31 07:50:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8511874568920988442.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/ReachabilityCardinality5430107744960859889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8511874568920988442.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (1203 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (271 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8511874568920988442.prop.
BEST_FIRST walk for 40004 steps (239 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 97
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :97 after 127
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :127 after 195
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :195 after 493
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :493 after 4141
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4141 after 14459
Interrupted probabilistic random walk after 408997 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 2
Probabilistic random walk after 408997 steps, saw 121938 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2025-05-31 07:50:32] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 07:50:32] [INFO ] Invariant cache hit.
[2025-05-31 07:50:32] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/189 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/375 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/535 variables, 79/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 38/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/551 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/553 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/553 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/553 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/189 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/375 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/376 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/535 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/551 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/553 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/553 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 864ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14459 after 27263
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 157/157 places, 433/433 transitions.
RANDOM walk for 40000 steps (1273 resets) in 440 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (283 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (280 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Interrupted probabilistic random walk after 402121 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 2
Probabilistic random walk after 402121 steps, saw 118852 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-14-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FireWire-PT-14-UpperBounds-11 in 74698 ms.
Starting property specific reduction for FireWire-PT-14-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:50:37] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
// Phase 1: matrix 430 rows 170 cols
[2025-05-31 07:50:37] [INFO ] Computed 7 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (316 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (76 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:50:37] [INFO ] Flow matrix only has 430 transitions (discarded 37 similar events)
[2025-05-31 07:50:37] [INFO ] Invariant cache hit.
[2025-05-31 07:50:37] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-31 07:50:37] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2025-05-31 07:50:37] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 07:50:37] [INFO ] [Real]Added 65 Read/Feed constraints in 41 ms returned sat
[2025-05-31 07:50:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:50:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 07:50:37] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2025-05-31 07:50:37] [INFO ] [Nat]Added 65 Read/Feed constraints in 61 ms returned sat
[2025-05-31 07:50:37] [INFO ] Computed and/alt/rep : 174/639/174 causal constraints (skipped 250 transitions) in 50 ms.
[2025-05-31 07:50:38] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 2 ms to minimize.
[2025-05-31 07:50:38] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 2 ms to minimize.
[2025-05-31 07:50:38] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 2 ms to minimize.
[2025-05-31 07:50:39] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 2 ms to minimize.
[2025-05-31 07:50:39] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2025-05-31 07:50:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 923 ms
[2025-05-31 07:50:39] [INFO ] Added : 38 causal constraints over 9 iterations in 1342 ms. Result :sat
Minimization took 252 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 170 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p90) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 465/465 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 168 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 168 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 167 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 167 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 166 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 166 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 165 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 165 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 164 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 164 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 163 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 163 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 162 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 162 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 161 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 161 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 160 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 160 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 159 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 159 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 158 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 158 transition count 436
Applied a total of 24 rules in 36 ms. Remains 158 /170 variables (removed 12) and now considering 436/465 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 158/170 places, 436/465 transitions.
[2025-05-31 07:50:39] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
// Phase 1: matrix 399 rows 158 cols
[2025-05-31 07:50:39] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32124 resets) in 2065 ms. (484 steps per ms)
BEST_FIRST walk for 1000000 steps (6856 resets) in 593 ms. (1683 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:50:42] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 07:50:42] [INFO ] Invariant cache hit.
[2025-05-31 07:50:42] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:50:42] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-05-31 07:50:42] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 07:50:42] [INFO ] [Real]Added 60 Read/Feed constraints in 26 ms returned sat
[2025-05-31 07:50:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:50:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 07:50:42] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-31 07:50:42] [INFO ] [Nat]Added 60 Read/Feed constraints in 74 ms returned sat
[2025-05-31 07:50:42] [INFO ] Computed and/alt/rep : 163/596/163 causal constraints (skipped 230 transitions) in 35 ms.
[2025-05-31 07:50:42] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2025-05-31 07:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2025-05-31 07:50:43] [INFO ] Added : 14 causal constraints over 4 iterations in 270 ms. Result :sat
Minimization took 215 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 158/158 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2025-05-31 07:50:43] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 07:50:43] [INFO ] Invariant cache hit.
[2025-05-31 07:50:43] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-05-31 07:50:43] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 07:50:43] [INFO ] Invariant cache hit.
[2025-05-31 07:50:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 07:50:44] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2025-05-31 07:50:44] [INFO ] Redundant transitions in 3 ms returned []
Running 430 sub problems to find dead transitions.
[2025-05-31 07:50:44] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 07:50:44] [INFO ] Invariant cache hit.
[2025-05-31 07:50:44] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 07:50:47] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2025-05-31 07:50:48] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 07:50:55] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 3 ms to minimize.
[2025-05-31 07:50:55] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 3 ms to minimize.
[2025-05-31 07:50:55] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 2 ms to minimize.
[2025-05-31 07:50:55] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 2 ms to minimize.
[2025-05-31 07:50:56] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 2 ms to minimize.
[2025-05-31 07:50:56] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 3 ms to minimize.
[2025-05-31 07:50:57] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 2 ms to minimize.
[2025-05-31 07:50:58] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2025-05-31 07:50:58] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2025-05-31 07:50:59] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 07:50:59] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 399/557 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/557 variables, and 238 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (OVERLAPS) 399/557 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 430/668 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 07:51:33] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 669 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 14/14 constraints]
After SMT, in 60498ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60504ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61291 ms. Remains : 158/158 places, 436/436 transitions.
[2025-05-31 07:51:44] [INFO ] Flatten gal took : 27 ms
[2025-05-31 07:51:44] [INFO ] Flatten gal took : 29 ms
[2025-05-31 07:51:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8889547557121620045.gal : 5 ms
[2025-05-31 07:51:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17138547249282853298.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/ReachabilityCardinality8889547557121620045.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17138547249282853298.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/ReachabilityCardinality17138547249282853298.prop.
RANDOM walk for 40000 steps (1323 resets) in 557 ms. (71 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 63
BEST_FIRST walk for 40004 steps (272 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 97
BEST_FIRST walk for 40003 steps (255 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :97 after 127
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :127 after 195
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :195 after 493
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :493 after 4135
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4135 after 15455
Interrupted probabilistic random walk after 420635 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 2
Probabilistic random walk after 420635 steps, saw 125531 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2025-05-31 07:51:47] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 07:51:47] [INFO ] Invariant cache hit.
[2025-05-31 07:51:47] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 143/193 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/379 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/380 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/539 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/555 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/555 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/557 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 143/193 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/379 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/380 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/539 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/555 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/557 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/557 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/557 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 785ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 436/436 transitions.
RANDOM walk for 40000 steps (1299 resets) in 783 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (297 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (263 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :15455 after 20358
Interrupted probabilistic random walk after 414369 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 2
Probabilistic random walk after 414369 steps, saw 123818 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2025-05-31 07:51:51] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 07:51:51] [INFO ] Invariant cache hit.
[2025-05-31 07:51:51] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 143/193 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/379 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/380 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/539 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/555 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/555 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/557 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 143/193 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/379 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/380 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/539 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/555 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/557 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/557 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/557 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 867ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2025-05-31 07:51:52] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 07:51:52] [INFO ] Invariant cache hit.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
[2025-05-31 07:51:53] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-05-31 07:51:53] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 07:51:53] [INFO ] Invariant cache hit.
[2025-05-31 07:51:53] [INFO ] State equation strengthened by 60 read => feed constraints.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,158407,8.88417,129892,2,6177,18,229510,6,0,1065,305511,0
Total reachable state count : 158407
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,84,8.88764,129892,2,277,18,229510,7,0,1068,305511,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,84,8.89014,129892,2,277,18,229510,8,0,1069,305511,0
[2025-05-31 07:51:53] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2025-05-31 07:51:53] [INFO ] Redundant transitions in 3 ms returned []
Running 430 sub problems to find dead transitions.
[2025-05-31 07:51:53] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 07:51:53] [INFO ] Invariant cache hit.
[2025-05-31 07:51:53] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 07:51:56] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2025-05-31 07:51:57] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 07:52:03] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 3 ms to minimize.
[2025-05-31 07:52:03] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 3 ms to minimize.
[2025-05-31 07:52:03] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2025-05-31 07:52:03] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 3 ms to minimize.
[2025-05-31 07:52:04] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2025-05-31 07:52:04] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 2 ms to minimize.
[2025-05-31 07:52:05] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2025-05-31 07:52:05] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
[2025-05-31 07:52:06] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
[2025-05-31 07:52:06] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 07:52:07] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 399/557 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/557 variables, and 238 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (OVERLAPS) 399/557 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 430/668 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 07:52:44] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 669 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 14/14 constraints]
After SMT, in 60470ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61360 ms. Remains : 158/158 places, 436/436 transitions.
FORMULA FireWire-PT-14-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FireWire-PT-14-UpperBounds-14 in 137033 ms.
[2025-05-31 07:52:54] [INFO ] Flatten gal took : 21 ms
[2025-05-31 07:52:54] [INFO ] Applying decomposition
[2025-05-31 07:52:54] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5892520966993519206.txt' '-o' '/tmp/graph5892520966993519206.bin' '-w' '/tmp/graph5892520966993519206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5892520966993519206.bin' '-l' '-1' '-v' '-w' '/tmp/graph5892520966993519206.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:52:54] [INFO ] Decomposing Gal with order
[2025-05-31 07:52:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:52:54] [INFO ] Removed a total of 735 redundant transitions.
[2025-05-31 07:52:54] [INFO ] Flatten gal took : 37 ms
[2025-05-31 07:52:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 14 ms.
[2025-05-31 07:52:54] [INFO ] Time to serialize gal into /tmp/UpperBounds15418907574798717193.gal : 4 ms
[2025-05-31 07:52:54] [INFO ] Time to serialize properties into /tmp/UpperBounds11970177308191374898.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/UpperBounds15418907574798717193.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11970177308191374898.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds11970177308191374898.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.66705e+08,121.179,1182160,5384,610,1.56764e+06,51121,744,4.37417e+06,133,478369,0
Total reachable state count : 266705212
Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-14-UpperBounds-00 :0 <= i0.u41.p153 <= 1
FORMULA FireWire-PT-14-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-14-UpperBounds-00,0,122.89,1182160,1,0,1.56764e+06,51121,968,4.37417e+06,158,478369,2360
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-14-UpperBounds-03 :0 <= i3.u23.p93 <= 1
FORMULA FireWire-PT-14-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-14-UpperBounds-03,0,122.945,1182160,1,0,1.56764e+06,51121,1023,4.37417e+06,163,478369,3414
Total runtime 817451 ms.
BK_STOP 1748678097605
--------------------
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="FireWire-PT-14"
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 FireWire-PT-14, 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 r097-smll-174860111800044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 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 ;