About the Execution of ITS-Tools for FunctionPointer-PT-c064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.520 | 3600000.00 | 5000792.00 | 9756.00 | 0 64 ? ? 0 1 ? ? 0 0 ? ? ? ? ? 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/mcc2024-input.r180-tall-171640603100317.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is FunctionPointer-PT-c064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100317
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 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
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716491225013
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-23 19:07:06] [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]
[2024-05-23 19:07:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:07:06] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2024-05-23 19:07:06] [INFO ] Transformed 2826 places.
[2024-05-23 19:07:06] [INFO ] Transformed 8960 transitions.
[2024-05-23 19:07:06] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 544 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 1198 places in 40 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:07:06] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 19:07:07] [INFO ] Computed 4 invariants in 95 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[64, +inf, 64, 1, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1]
RANDOM walk for 10028 steps (2 resets) in 177 ms. (56 steps per ms)
FORMULA FunctionPointer-PT-c064-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (38 resets) in 310 ms. (353 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3, 1, 1, 1, 3, 0, 1, 4, 0, 0] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1]
[2024-05-23 19:07:07] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-23 19:07:07] [INFO ] Invariant cache hit.
[2024-05-23 19:07:08] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-23 19:07:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 19:07:08] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2024-05-23 19:07:09] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-23 19:07:09] [INFO ] [Real]Added 479 Read/Feed constraints in 149 ms returned sat
[2024-05-23 19:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2024-05-23 19:07:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:07:10] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2024-05-23 19:07:10] [INFO ] [Nat]Added 479 Read/Feed constraints in 216 ms returned sat
[2024-05-23 19:07:11] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 793 ms.
[2024-05-23 19:07:11] [INFO ] Added : 3 causal constraints over 1 iterations in 1190 ms. Result :sat
Minimization took 596 ms.
[2024-05-23 19:07:12] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:07:13] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2024-05-23 19:07:13] [INFO ] [Real]Added 479 Read/Feed constraints in 165 ms returned sat
[2024-05-23 19:07:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-23 19:07:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:14] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2024-05-23 19:07:14] [INFO ] [Nat]Added 479 Read/Feed constraints in 140 ms returned sat
[2024-05-23 19:07:15] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 433 ms.
[2024-05-23 19:07:15] [INFO ] Added : 2 causal constraints over 1 iterations in 768 ms. Result :sat
Minimization took 579 ms.
[2024-05-23 19:07:16] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 19:07:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:17] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2024-05-23 19:07:17] [INFO ] [Real]Added 479 Read/Feed constraints in 196 ms returned sat
[2024-05-23 19:07:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2024-05-23 19:07:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:18] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2024-05-23 19:07:18] [INFO ] [Nat]Added 479 Read/Feed constraints in 159 ms returned sat
[2024-05-23 19:07:20] [INFO ] Deduced a trap composed of 147 places in 1266 ms of which 88 ms to minimize.
[2024-05-23 19:07:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1459 ms
[2024-05-23 19:07:20] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 523 ms.
[2024-05-23 19:07:21] [INFO ] Added : 2 causal constraints over 1 iterations in 866 ms. Result :sat
Minimization took 579 ms.
[2024-05-23 19:07:21] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 19:07:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:22] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2024-05-23 19:07:23] [INFO ] [Real]Added 479 Read/Feed constraints in 203 ms returned sat
[2024-05-23 19:07:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 19:07:24] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2024-05-23 19:07:24] [INFO ] [Nat]Added 479 Read/Feed constraints in 128 ms returned sat
[2024-05-23 19:07:24] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 433 ms.
[2024-05-23 19:07:25] [INFO ] Added : 2 causal constraints over 1 iterations in 748 ms. Result :sat
Minimization took 583 ms.
[2024-05-23 19:07:25] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:26] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2024-05-23 19:07:26] [INFO ] [Real]Added 479 Read/Feed constraints in 192 ms returned sat
[2024-05-23 19:07:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2024-05-23 19:07:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:07:27] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2024-05-23 19:07:27] [INFO ] [Nat]Added 479 Read/Feed constraints in 108 ms returned sat
[2024-05-23 19:07:28] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 427 ms.
[2024-05-23 19:07:28] [INFO ] Added : 1 causal constraints over 1 iterations in 748 ms. Result :sat
Minimization took 604 ms.
[2024-05-23 19:07:29] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:07:30] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2024-05-23 19:07:30] [INFO ] [Real]Added 479 Read/Feed constraints in 136 ms returned sat
[2024-05-23 19:07:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:07:31] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2024-05-23 19:07:31] [INFO ] [Nat]Added 479 Read/Feed constraints in 127 ms returned sat
[2024-05-23 19:07:32] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 455 ms.
[2024-05-23 19:07:32] [INFO ] Added : 2 causal constraints over 1 iterations in 785 ms. Result :sat
Minimization took 605 ms.
[2024-05-23 19:07:33] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:34] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2024-05-23 19:07:34] [INFO ] [Real]Added 479 Read/Feed constraints in 184 ms returned sat
[2024-05-23 19:07:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:35] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2024-05-23 19:07:35] [INFO ] [Nat]Added 479 Read/Feed constraints in 105 ms returned sat
[2024-05-23 19:07:36] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 498 ms.
[2024-05-23 19:07:37] [INFO ] Deduced a trap composed of 142 places in 1195 ms of which 12 ms to minimize.
[2024-05-23 19:07:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1418 ms
[2024-05-23 19:07:38] [INFO ] Added : 2 causal constraints over 1 iterations in 2338 ms. Result :sat
Minimization took 587 ms.
[2024-05-23 19:07:38] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 19:07:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:39] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2024-05-23 19:07:39] [INFO ] [Real]Added 479 Read/Feed constraints in 107 ms returned sat
[2024-05-23 19:07:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:40] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2024-05-23 19:07:41] [INFO ] [Nat]Added 479 Read/Feed constraints in 150 ms returned sat
[2024-05-23 19:07:42] [INFO ] Deduced a trap composed of 134 places in 1232 ms of which 11 ms to minimize.
[2024-05-23 19:07:43] [INFO ] Deduced a trap composed of 133 places in 1197 ms of which 11 ms to minimize.
[2024-05-23 19:07:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2909 ms
[2024-05-23 19:07:44] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 444 ms.
[2024-05-23 19:07:44] [INFO ] Added : 2 causal constraints over 1 iterations in 777 ms. Result :sat
Minimization took 192 ms.
[2024-05-23 19:07:45] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 19:07:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:07:46] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2024-05-23 19:07:46] [INFO ] [Real]Added 479 Read/Feed constraints in 116 ms returned sat
[2024-05-23 19:07:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-23 19:07:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:47] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2024-05-23 19:07:47] [INFO ] [Nat]Added 479 Read/Feed constraints in 104 ms returned sat
[2024-05-23 19:07:47] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 474 ms.
[2024-05-23 19:07:48] [INFO ] Added : 1 causal constraints over 1 iterations in 803 ms. Result :sat
Minimization took 597 ms.
[2024-05-23 19:07:49] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:49] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2024-05-23 19:07:50] [INFO ] [Real]Added 479 Read/Feed constraints in 232 ms returned sat
[2024-05-23 19:07:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:51] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2024-05-23 19:07:51] [INFO ] [Nat]Added 479 Read/Feed constraints in 120 ms returned sat
[2024-05-23 19:07:51] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 462 ms.
[2024-05-23 19:07:52] [INFO ] Added : 2 causal constraints over 1 iterations in 815 ms. Result :sat
Minimization took 583 ms.
[2024-05-23 19:07:53] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:07:53] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2024-05-23 19:07:54] [INFO ] [Real]Added 479 Read/Feed constraints in 139 ms returned sat
[2024-05-23 19:07:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:07:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 19:07:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:07:55] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2024-05-23 19:07:55] [INFO ] [Nat]Added 479 Read/Feed constraints in 97 ms returned sat
[2024-05-23 19:07:55] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 431 ms.
[2024-05-23 19:07:56] [INFO ] Added : 2 causal constraints over 1 iterations in 786 ms. Result :sat
Minimization took 597 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3, 1, 1, 1, 3, 0, 1, 4, 0, 0] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 3, 1, 1, 1, 3, 0, 1, 4, 0, 0] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1]
Support contains 11 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.17 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 1422 transition count 5584
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 678 place count 1123 transition count 3292
Iterating global reduction 1 with 299 rules applied. Total rules applied 977 place count 1123 transition count 3292
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 1325 place count 1123 transition count 2944
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1480 place count 968 transition count 2634
Iterating global reduction 2 with 155 rules applied. Total rules applied 1635 place count 968 transition count 2634
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1695 place count 968 transition count 2574
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1709 place count 954 transition count 2546
Iterating global reduction 3 with 14 rules applied. Total rules applied 1723 place count 954 transition count 2546
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1737 place count 940 transition count 2518
Iterating global reduction 3 with 14 rules applied. Total rules applied 1751 place count 940 transition count 2518
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1765 place count 926 transition count 2490
Iterating global reduction 3 with 14 rules applied. Total rules applied 1779 place count 926 transition count 2490
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1793 place count 912 transition count 2462
Iterating global reduction 3 with 14 rules applied. Total rules applied 1807 place count 912 transition count 2462
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1821 place count 898 transition count 2434
Iterating global reduction 3 with 14 rules applied. Total rules applied 1835 place count 898 transition count 2434
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1847 place count 886 transition count 2410
Iterating global reduction 3 with 12 rules applied. Total rules applied 1859 place count 886 transition count 2410
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1871 place count 874 transition count 2386
Iterating global reduction 3 with 12 rules applied. Total rules applied 1883 place count 874 transition count 2386
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1929 place count 828 transition count 2216
Iterating global reduction 3 with 46 rules applied. Total rules applied 1975 place count 828 transition count 2216
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2034 place count 769 transition count 1980
Iterating global reduction 3 with 59 rules applied. Total rules applied 2093 place count 769 transition count 1980
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2151 place count 711 transition count 1824
Iterating global reduction 3 with 58 rules applied. Total rules applied 2209 place count 711 transition count 1824
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2266 place count 654 transition count 1710
Iterating global reduction 3 with 57 rules applied. Total rules applied 2323 place count 654 transition count 1710
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2380 place count 597 transition count 1596
Iterating global reduction 3 with 57 rules applied. Total rules applied 2437 place count 597 transition count 1596
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2494 place count 540 transition count 1482
Iterating global reduction 3 with 57 rules applied. Total rules applied 2551 place count 540 transition count 1482
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2607 place count 484 transition count 1370
Iterating global reduction 3 with 56 rules applied. Total rules applied 2663 place count 484 transition count 1370
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2683 place count 464 transition count 1330
Iterating global reduction 3 with 20 rules applied. Total rules applied 2703 place count 464 transition count 1330
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 2715 place count 464 transition count 1318
Applied a total of 2715 rules in 1198 ms. Remains 464 /1628 variables (removed 1164) and now considering 1318/5962 (removed 4644) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1210 ms. Remains : 464/1628 places, 1318/5962 transitions.
[2024-05-23 19:07:57] [INFO ] Flow matrix only has 762 transitions (discarded 556 similar events)
Found an invariant !
This invariant on transitions {205=1, 334=1, 538=1, 744=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {253=1, 382=1, 586=1, 749=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 11) seen :[2, 3, 0, 2, 2, 3, 3, 1, 2, 2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 3, 3, 1, 4, 2, 1] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1]
[2024-05-23 19:07:58] [INFO ] Flow matrix only has 762 transitions (discarded 556 similar events)
// Phase 1: matrix 762 rows 464 cols
[2024-05-23 19:07:58] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 2, 2, 3, 3, 1, 4, 2, 1] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1]
FORMULA FunctionPointer-PT-c064-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000001 steps (2 resets) in 2414 ms. (414 steps per ms)
BEST_FIRST walk for 10000010 steps (24 resets) in 14717 ms. (679 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 95, 2, 114, 840, 48, 79, 12, 74, 46] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:08:15] [INFO ] Flow matrix only has 762 transitions (discarded 556 similar events)
[2024-05-23 19:08:15] [INFO ] Invariant cache hit.
[2024-05-23 19:08:15] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-23 19:08:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:15] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:08:15] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 19:08:15] [INFO ] [Real]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-23 19:08:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:16] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 19:08:16] [INFO ] [Nat]Added 95 Read/Feed constraints in 44 ms returned sat
[2024-05-23 19:08:16] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 80 ms.
[2024-05-23 19:08:16] [INFO ] Added : 1 causal constraints over 1 iterations in 180 ms. Result :sat
Minimization took 458 ms.
[2024-05-23 19:08:16] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:17] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-23 19:08:17] [INFO ] [Real]Added 95 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:08:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:17] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 19:08:17] [INFO ] [Nat]Added 95 Read/Feed constraints in 23 ms returned sat
[2024-05-23 19:08:17] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 70 ms.
[2024-05-23 19:08:17] [INFO ] Added : 4 causal constraints over 2 iterations in 213 ms. Result :sat
Minimization took 448 ms.
[2024-05-23 19:08:18] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:18] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 19:08:18] [INFO ] [Real]Added 95 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:08:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:18] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 19:08:18] [INFO ] [Nat]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-23 19:08:18] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 79 ms.
[2024-05-23 19:08:18] [INFO ] Added : 1 causal constraints over 1 iterations in 180 ms. Result :sat
Minimization took 464 ms.
[2024-05-23 19:08:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:19] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 19:08:19] [INFO ] [Real]Added 95 Read/Feed constraints in 25 ms returned sat
[2024-05-23 19:08:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-23 19:08:20] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-23 19:08:20] [INFO ] [Nat]Added 95 Read/Feed constraints in 25 ms returned sat
[2024-05-23 19:08:20] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 70 ms.
[2024-05-23 19:08:20] [INFO ] Added : 22 causal constraints over 6 iterations in 354 ms. Result :sat
Minimization took 468 ms.
[2024-05-23 19:08:20] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2024-05-23 19:08:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:21] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 19:08:21] [INFO ] [Real]Added 95 Read/Feed constraints in 47 ms returned sat
[2024-05-23 19:08:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:21] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-23 19:08:21] [INFO ] [Nat]Added 95 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:08:21] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 68 ms.
[2024-05-23 19:08:21] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 505 ms.
[2024-05-23 19:08:22] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:22] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:08:22] [INFO ] [Real]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 19:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:22] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 19:08:22] [INFO ] [Nat]Added 95 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:08:22] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 77 ms.
[2024-05-23 19:08:23] [INFO ] Added : 5 causal constraints over 3 iterations in 259 ms. Result :sat
Minimization took 466 ms.
[2024-05-23 19:08:23] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:23] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 19:08:23] [INFO ] [Real]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-23 19:08:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:24] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 19:08:24] [INFO ] [Nat]Added 95 Read/Feed constraints in 23 ms returned sat
[2024-05-23 19:08:24] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 80 ms.
[2024-05-23 19:08:24] [INFO ] Added : 5 causal constraints over 3 iterations in 259 ms. Result :sat
Minimization took 512 ms.
[2024-05-23 19:08:25] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:08:25] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 19:08:25] [INFO ] [Real]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-23 19:08:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:25] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 19:08:25] [INFO ] [Nat]Added 95 Read/Feed constraints in 72 ms returned sat
[2024-05-23 19:08:25] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 69 ms.
[2024-05-23 19:08:25] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 535 ms.
[2024-05-23 19:08:26] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:26] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 19:08:26] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 19:08:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:26] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 19:08:26] [INFO ] [Nat]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-23 19:08:27] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 80 ms.
[2024-05-23 19:08:27] [INFO ] Added : 1 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 496 ms.
[2024-05-23 19:08:27] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:27] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:08:27] [INFO ] [Real]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 19:08:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:08:28] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-23 19:08:28] [INFO ] [Nat]Added 95 Read/Feed constraints in 28 ms returned sat
[2024-05-23 19:08:28] [INFO ] Computed and/alt/rep : 108/208/95 causal constraints (skipped 665 transitions) in 78 ms.
[2024-05-23 19:08:28] [INFO ] Added : 17 causal constraints over 4 iterations in 294 ms. Result :sat
Minimization took 512 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17, 95, 2, 114, 840, 48, 79, 12, 74, 46] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63, 95, 62, 114, 840, 48, 79, 63, 74, 46] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1318/1318 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 462 transition count 1314
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 462 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 461 transition count 1312
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 461 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 460 transition count 1310
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 460 transition count 1310
Applied a total of 8 rules in 102 ms. Remains 460 /464 variables (removed 4) and now considering 1310/1318 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 460/464 places, 1310/1318 transitions.
[2024-05-23 19:08:30] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {222=1, 348=1, 551=1, 742=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {255=1, 381=1, 584=1, 744=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :[0, 3, 1, 2, 2, 2, 2, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[63, 95, 62, 114, 840, 48, 79, 63, 74, 46] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:08:30] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:08:30] [INFO ] Computed 2 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[63, 95, 62, 114, 840, 48, 79, 63, 74, 46] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2400 ms. (416 steps per ms)
BEST_FIRST walk for 10000010 steps (25 resets) in 14634 ms. (683 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63, 95, 62, 114, 840, 88, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:08:47] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:08:47] [INFO ] Invariant cache hit.
[2024-05-23 19:08:47] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:47] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:08:47] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:08:47] [INFO ] [Real]Added 92 Read/Feed constraints in 51 ms returned sat
[2024-05-23 19:08:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:48] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:08:48] [INFO ] [Nat]Added 92 Read/Feed constraints in 35 ms returned sat
[2024-05-23 19:08:48] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:08:48] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 508 ms.
[2024-05-23 19:08:48] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:49] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:08:49] [INFO ] [Real]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:08:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:49] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:08:49] [INFO ] [Nat]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:08:49] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 75 ms.
[2024-05-23 19:08:49] [INFO ] Added : 16 causal constraints over 5 iterations in 317 ms. Result :sat
Minimization took 510 ms.
[2024-05-23 19:08:50] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:50] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:08:50] [INFO ] [Real]Added 92 Read/Feed constraints in 38 ms returned sat
[2024-05-23 19:08:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:50] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 19:08:50] [INFO ] [Nat]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:08:50] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 74 ms.
[2024-05-23 19:08:51] [INFO ] Added : 1 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 496 ms.
[2024-05-23 19:08:51] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:51] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 19:08:51] [INFO ] [Real]Added 92 Read/Feed constraints in 45 ms returned sat
[2024-05-23 19:08:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:52] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:08:52] [INFO ] [Nat]Added 92 Read/Feed constraints in 44 ms returned sat
[2024-05-23 19:08:52] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 68 ms.
[2024-05-23 19:08:52] [INFO ] Added : 15 causal constraints over 5 iterations in 306 ms. Result :sat
Minimization took 501 ms.
[2024-05-23 19:08:53] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:53] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:08:53] [INFO ] [Real]Added 92 Read/Feed constraints in 67 ms returned sat
[2024-05-23 19:08:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:53] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-05-23 19:08:53] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:08:53] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:08:53] [INFO ] Added : 1 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 493 ms.
[2024-05-23 19:08:54] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-23 19:08:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:54] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-05-23 19:08:54] [INFO ] [Real]Added 92 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:54] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:08:55] [INFO ] [Nat]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:08:55] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 81 ms.
[2024-05-23 19:08:55] [INFO ] Added : 14 causal constraints over 4 iterations in 282 ms. Result :sat
Minimization took 498 ms.
[2024-05-23 19:08:55] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:56] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:08:56] [INFO ] [Real]Added 92 Read/Feed constraints in 37 ms returned sat
[2024-05-23 19:08:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:08:56] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 19:08:56] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:08:56] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 80 ms.
[2024-05-23 19:08:56] [INFO ] Added : 13 causal constraints over 4 iterations in 285 ms. Result :sat
Minimization took 473 ms.
[2024-05-23 19:08:57] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:57] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:08:57] [INFO ] [Real]Added 92 Read/Feed constraints in 56 ms returned sat
[2024-05-23 19:08:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-23 19:08:57] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 19:08:57] [INFO ] [Nat]Added 92 Read/Feed constraints in 51 ms returned sat
[2024-05-23 19:08:58] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 19:08:58] [INFO ] Added : 2 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 481 ms.
[2024-05-23 19:08:58] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:08:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:58] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 19:08:58] [INFO ] [Real]Added 92 Read/Feed constraints in 26 ms returned sat
[2024-05-23 19:08:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:08:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:08:59] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 19:08:59] [INFO ] [Nat]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:08:59] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 70 ms.
[2024-05-23 19:08:59] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 444 ms.
[2024-05-23 19:08:59] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:08:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:09:00] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 19:09:00] [INFO ] [Real]Added 92 Read/Feed constraints in 26 ms returned sat
[2024-05-23 19:09:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:09:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:09:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:09:00] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:09:00] [INFO ] [Nat]Added 92 Read/Feed constraints in 21 ms returned sat
[2024-05-23 19:09:00] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 68 ms.
[2024-05-23 19:09:00] [INFO ] Added : 16 causal constraints over 4 iterations in 299 ms. Result :sat
Minimization took 434 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63, 95, 62, 114, 840, 88, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63, 95, 62, 114, 840, 88, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 53 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 460/460 places, 1310/1310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 97 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2024-05-23 19:09:02] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:09:02] [INFO ] Invariant cache hit.
[2024-05-23 19:09:02] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-23 19:09:02] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:09:02] [INFO ] Invariant cache hit.
[2024-05-23 19:09:02] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:09:03] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
[2024-05-23 19:09:04] [INFO ] Redundant transitions in 77 ms returned []
Running 1308 sub problems to find dead transitions.
[2024-05-23 19:09:04] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:09:04] [INFO ] Invariant cache hit.
[2024-05-23 19:09:04] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 755/1215 variables, 460/462 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
SMT process timed out in 35488ms, After SMT, problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 35552ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37568 ms. Remains : 460/460 places, 1310/1310 transitions.
[2024-05-23 19:09:39] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {222=1, 348=1, 551=1, 742=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {255=1, 381=1, 584=1, 744=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :[2, 4, 0, 2, 6, 4, 1, 1, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[63, 95, 62, 114, 840, 88, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:09:40] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:09:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[63, 95, 62, 114, 840, 88, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 2640 ms. (378 steps per ms)
BEST_FIRST walk for 10000010 steps (21 resets) in 13709 ms. (729 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63, 95, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:09:56] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:09:56] [INFO ] Invariant cache hit.
[2024-05-23 19:09:56] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:09:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:09:56] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 19:09:56] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:09:56] [INFO ] [Real]Added 92 Read/Feed constraints in 40 ms returned sat
[2024-05-23 19:09:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:09:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:09:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:09:56] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:09:56] [INFO ] [Nat]Added 92 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:09:57] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 70 ms.
[2024-05-23 19:09:57] [INFO ] Added : 1 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 427 ms.
[2024-05-23 19:09:57] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:09:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:09:57] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 19:09:57] [INFO ] [Real]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:09:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:09:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:09:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:09:58] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:09:58] [INFO ] [Nat]Added 92 Read/Feed constraints in 29 ms returned sat
[2024-05-23 19:09:58] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 66 ms.
[2024-05-23 19:09:58] [INFO ] Added : 16 causal constraints over 5 iterations in 307 ms. Result :sat
Minimization took 421 ms.
[2024-05-23 19:09:59] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:09:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:09:59] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 19:09:59] [INFO ] [Real]Added 92 Read/Feed constraints in 38 ms returned sat
[2024-05-23 19:09:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:09:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:09:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:09:59] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 19:09:59] [INFO ] [Nat]Added 92 Read/Feed constraints in 29 ms returned sat
[2024-05-23 19:09:59] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:09:59] [INFO ] Added : 1 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 424 ms.
[2024-05-23 19:10:00] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-23 19:10:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:00] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 19:10:00] [INFO ] [Real]Added 92 Read/Feed constraints in 41 ms returned sat
[2024-05-23 19:10:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:10:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:10:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:00] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:10:00] [INFO ] [Nat]Added 92 Read/Feed constraints in 43 ms returned sat
[2024-05-23 19:10:00] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:10:01] [INFO ] Added : 15 causal constraints over 5 iterations in 308 ms. Result :sat
Minimization took 419 ms.
[2024-05-23 19:10:01] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-23 19:10:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:01] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 19:10:01] [INFO ] [Real]Added 92 Read/Feed constraints in 50 ms returned sat
[2024-05-23 19:10:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:10:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:10:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:02] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-23 19:10:02] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:10:02] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 19:10:02] [INFO ] Added : 1 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 428 ms.
[2024-05-23 19:10:02] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:10:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 19:10:03] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-05-23 19:10:03] [INFO ] [Real]Added 92 Read/Feed constraints in 47 ms returned sat
[2024-05-23 19:10:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:10:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:10:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:03] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 19:10:03] [INFO ] [Nat]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:10:03] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:10:03] [INFO ] Added : 14 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 428 ms.
[2024-05-23 19:10:04] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:10:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:04] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-23 19:10:04] [INFO ] [Real]Added 92 Read/Feed constraints in 38 ms returned sat
[2024-05-23 19:10:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:10:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:10:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:04] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 19:10:04] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:10:04] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 67 ms.
[2024-05-23 19:10:05] [INFO ] Added : 13 causal constraints over 4 iterations in 269 ms. Result :sat
Minimization took 410 ms.
[2024-05-23 19:10:05] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:10:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 19:10:05] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 19:10:05] [INFO ] [Real]Added 92 Read/Feed constraints in 54 ms returned sat
[2024-05-23 19:10:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:10:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-23 19:10:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:10:06] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 19:10:06] [INFO ] [Nat]Added 92 Read/Feed constraints in 47 ms returned sat
[2024-05-23 19:10:06] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 68 ms.
[2024-05-23 19:10:06] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 439 ms.
[2024-05-23 19:10:06] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:10:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:07] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 19:10:07] [INFO ] [Real]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:10:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:10:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:10:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:07] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 19:10:07] [INFO ] [Nat]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:10:07] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 68 ms.
[2024-05-23 19:10:07] [INFO ] Added : 1 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 420 ms.
[2024-05-23 19:10:08] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-23 19:10:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:08] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 19:10:08] [INFO ] [Real]Added 92 Read/Feed constraints in 26 ms returned sat
[2024-05-23 19:10:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:10:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:10:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:10:08] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 19:10:08] [INFO ] [Nat]Added 92 Read/Feed constraints in 20 ms returned sat
[2024-05-23 19:10:08] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 19:10:08] [INFO ] Added : 16 causal constraints over 4 iterations in 296 ms. Result :sat
Minimization took 418 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63, 95, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63, 95, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 61 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 460/460 places, 1310/1310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 76 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2024-05-23 19:10:10] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:10:10] [INFO ] Invariant cache hit.
[2024-05-23 19:10:10] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-23 19:10:10] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:10:10] [INFO ] Invariant cache hit.
[2024-05-23 19:10:10] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:10:12] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 1899 ms to find 0 implicit places.
[2024-05-23 19:10:12] [INFO ] Redundant transitions in 21 ms returned []
Running 1308 sub problems to find dead transitions.
[2024-05-23 19:10:12] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:10:12] [INFO ] Invariant cache hit.
[2024-05-23 19:10:12] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 3 (OVERLAPS) 755/1215 variables, 460/462 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
SMT process timed out in 34647ms, After SMT, problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 34663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36677 ms. Remains : 460/460 places, 1310/1310 transitions.
[2024-05-23 19:10:46] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {222=1, 348=1, 551=1, 742=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {255=1, 381=1, 584=1, 744=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :[2, 4, 2, 4, 3, 3, 1, 5, 2, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[63, 95, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:10:47] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:10:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[63, 95, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2443 ms. (409 steps per ms)
BEST_FIRST walk for 10000009 steps (24 resets) in 13722 ms. (728 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63, 134, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:11:03] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:11:03] [INFO ] Invariant cache hit.
[2024-05-23 19:11:03] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:11:03] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-23 19:11:03] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:11:03] [INFO ] [Real]Added 92 Read/Feed constraints in 49 ms returned sat
[2024-05-23 19:11:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:11:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:11:04] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-23 19:11:04] [INFO ] [Nat]Added 92 Read/Feed constraints in 35 ms returned sat
[2024-05-23 19:11:04] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 72 ms.
[2024-05-23 19:11:04] [INFO ] Added : 1 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 485 ms.
[2024-05-23 19:11:04] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-23 19:11:05] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:11:05] [INFO ] [Real]Added 92 Read/Feed constraints in 39 ms returned sat
[2024-05-23 19:11:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:11:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 19:11:05] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-23 19:11:05] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:11:05] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 19:11:05] [INFO ] Added : 16 causal constraints over 5 iterations in 320 ms. Result :sat
Minimization took 499 ms.
[2024-05-23 19:11:06] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:11:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:11:06] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:11:06] [INFO ] [Real]Added 92 Read/Feed constraints in 41 ms returned sat
[2024-05-23 19:11:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:11:06] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 19:11:06] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:11:06] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 68 ms.
[2024-05-23 19:11:07] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 451 ms.
[2024-05-23 19:11:07] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 19:11:07] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 19:11:07] [INFO ] [Real]Added 92 Read/Feed constraints in 45 ms returned sat
[2024-05-23 19:11:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-23 19:11:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:11:08] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-23 19:11:08] [INFO ] [Nat]Added 92 Read/Feed constraints in 47 ms returned sat
[2024-05-23 19:11:08] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 19:11:08] [INFO ] Added : 15 causal constraints over 5 iterations in 331 ms. Result :sat
Minimization took 543 ms.
[2024-05-23 19:11:09] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:11:09] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-23 19:11:09] [INFO ] [Real]Added 92 Read/Feed constraints in 52 ms returned sat
[2024-05-23 19:11:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:11:09] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:11:09] [INFO ] [Nat]Added 92 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:11:09] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 72 ms.
[2024-05-23 19:11:09] [INFO ] Added : 1 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 450 ms.
[2024-05-23 19:11:10] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:11:10] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:11:10] [INFO ] [Real]Added 92 Read/Feed constraints in 39 ms returned sat
[2024-05-23 19:11:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:11:10] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:11:11] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:11:11] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 79 ms.
[2024-05-23 19:11:11] [INFO ] Added : 14 causal constraints over 4 iterations in 294 ms. Result :sat
Minimization took 462 ms.
[2024-05-23 19:11:11] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-23 19:11:12] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 19:11:12] [INFO ] [Real]Added 92 Read/Feed constraints in 41 ms returned sat
[2024-05-23 19:11:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:11:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:11:12] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 19:11:12] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:11:12] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 80 ms.
[2024-05-23 19:11:12] [INFO ] Added : 13 causal constraints over 4 iterations in 278 ms. Result :sat
Minimization took 472 ms.
[2024-05-23 19:11:13] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2024-05-23 19:11:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:11:13] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:11:13] [INFO ] [Real]Added 92 Read/Feed constraints in 61 ms returned sat
[2024-05-23 19:11:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:11:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:11:13] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 19:11:13] [INFO ] [Nat]Added 92 Read/Feed constraints in 49 ms returned sat
[2024-05-23 19:11:13] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 78 ms.
[2024-05-23 19:11:14] [INFO ] Added : 2 causal constraints over 1 iterations in 187 ms. Result :sat
Minimization took 486 ms.
[2024-05-23 19:11:14] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:11:14] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-23 19:11:14] [INFO ] [Real]Added 92 Read/Feed constraints in 28 ms returned sat
[2024-05-23 19:11:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:11:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:11:15] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-23 19:11:15] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:11:15] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 81 ms.
[2024-05-23 19:11:15] [INFO ] Added : 1 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 460 ms.
[2024-05-23 19:11:15] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:11:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:11:16] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:11:16] [INFO ] [Real]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:11:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:11:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:11:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:11:16] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-23 19:11:16] [INFO ] [Nat]Added 92 Read/Feed constraints in 21 ms returned sat
[2024-05-23 19:11:16] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 82 ms.
[2024-05-23 19:11:16] [INFO ] Added : 16 causal constraints over 4 iterations in 303 ms. Result :sat
Minimization took 464 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63, 134, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63, 134, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 54 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 460/460 places, 1310/1310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 52 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2024-05-23 19:11:18] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:11:18] [INFO ] Invariant cache hit.
[2024-05-23 19:11:18] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-23 19:11:18] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:11:18] [INFO ] Invariant cache hit.
[2024-05-23 19:11:18] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:11:20] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
[2024-05-23 19:11:20] [INFO ] Redundant transitions in 80 ms returned []
Running 1308 sub problems to find dead transitions.
[2024-05-23 19:11:20] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:11:20] [INFO ] Invariant cache hit.
[2024-05-23 19:11:20] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 3 (OVERLAPS) 755/1215 variables, 460/462 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
SMT process timed out in 34803ms, After SMT, problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 34817ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36757 ms. Remains : 460/460 places, 1310/1310 transitions.
[2024-05-23 19:11:54] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {222=1, 348=1, 551=1, 742=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {255=1, 381=1, 584=1, 744=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :[2, 1, 2, 2, 2, 3, 3, 0, 2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[63, 134, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:11:55] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:11:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[63, 134, 62, 114, 840, 106, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2480 ms. (403 steps per ms)
BEST_FIRST walk for 10000009 steps (22 resets) in 14657 ms. (682 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63, 134, 62, 114, 840, 140, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:12:12] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:12:12] [INFO ] Invariant cache hit.
[2024-05-23 19:12:12] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:12:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:12:12] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-23 19:12:12] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:12:12] [INFO ] [Real]Added 92 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:12:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:13] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-23 19:12:13] [INFO ] [Nat]Added 92 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:12:13] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 74 ms.
[2024-05-23 19:12:13] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 474 ms.
[2024-05-23 19:12:13] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:13] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 19:12:14] [INFO ] [Real]Added 92 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:12:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:14] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:12:14] [INFO ] [Nat]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:12:14] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 19:12:14] [INFO ] Added : 16 causal constraints over 5 iterations in 333 ms. Result :sat
Minimization took 456 ms.
[2024-05-23 19:12:15] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:12:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 19:12:15] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:12:15] [INFO ] [Real]Added 92 Read/Feed constraints in 41 ms returned sat
[2024-05-23 19:12:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:12:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:12:15] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:12:15] [INFO ] [Nat]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:12:15] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 81 ms.
[2024-05-23 19:12:15] [INFO ] Added : 1 causal constraints over 1 iterations in 180 ms. Result :sat
Minimization took 534 ms.
[2024-05-23 19:12:16] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:12:16] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:12:16] [INFO ] [Real]Added 92 Read/Feed constraints in 45 ms returned sat
[2024-05-23 19:12:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:12:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:17] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:12:17] [INFO ] [Nat]Added 92 Read/Feed constraints in 45 ms returned sat
[2024-05-23 19:12:17] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 76 ms.
[2024-05-23 19:12:17] [INFO ] Added : 15 causal constraints over 5 iterations in 323 ms. Result :sat
Minimization took 460 ms.
[2024-05-23 19:12:18] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:18] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 19:12:18] [INFO ] [Real]Added 92 Read/Feed constraints in 56 ms returned sat
[2024-05-23 19:12:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:12:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:12:18] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:12:18] [INFO ] [Nat]Added 92 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:12:18] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 81 ms.
[2024-05-23 19:12:18] [INFO ] Added : 1 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 522 ms.
[2024-05-23 19:12:19] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:12:19] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:12:19] [INFO ] [Real]Added 92 Read/Feed constraints in 37 ms returned sat
[2024-05-23 19:12:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:12:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:12:19] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 19:12:19] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:12:20] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 76 ms.
[2024-05-23 19:12:20] [INFO ] Added : 14 causal constraints over 4 iterations in 291 ms. Result :sat
Minimization took 446 ms.
[2024-05-23 19:12:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:12:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:20] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:12:21] [INFO ] [Real]Added 92 Read/Feed constraints in 37 ms returned sat
[2024-05-23 19:12:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:21] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 19:12:21] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:12:21] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 78 ms.
[2024-05-23 19:12:21] [INFO ] Added : 13 causal constraints over 4 iterations in 282 ms. Result :sat
Minimization took 452 ms.
[2024-05-23 19:12:22] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 19:12:22] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 19:12:22] [INFO ] [Real]Added 92 Read/Feed constraints in 59 ms returned sat
[2024-05-23 19:12:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:22] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 19:12:22] [INFO ] [Nat]Added 92 Read/Feed constraints in 52 ms returned sat
[2024-05-23 19:12:22] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 81 ms.
[2024-05-23 19:12:22] [INFO ] Added : 2 causal constraints over 1 iterations in 198 ms. Result :sat
Minimization took 547 ms.
[2024-05-23 19:12:23] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:23] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:12:23] [INFO ] [Real]Added 92 Read/Feed constraints in 28 ms returned sat
[2024-05-23 19:12:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:12:24] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-23 19:12:24] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:12:24] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 79 ms.
[2024-05-23 19:12:24] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 519 ms.
[2024-05-23 19:12:24] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:12:25] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 19:12:25] [INFO ] [Real]Added 92 Read/Feed constraints in 28 ms returned sat
[2024-05-23 19:12:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:12:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:12:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:12:25] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:12:25] [INFO ] [Nat]Added 92 Read/Feed constraints in 22 ms returned sat
[2024-05-23 19:12:25] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 80 ms.
[2024-05-23 19:12:25] [INFO ] Added : 16 causal constraints over 4 iterations in 299 ms. Result :sat
Minimization took 522 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63, 134, 62, 114, 840, 140, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63, 134, 62, 114, 840, 140, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 57 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 460/460 places, 1310/1310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 58 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2024-05-23 19:12:27] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:12:27] [INFO ] Invariant cache hit.
[2024-05-23 19:12:27] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-23 19:12:27] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:12:27] [INFO ] Invariant cache hit.
[2024-05-23 19:12:27] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:12:28] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
[2024-05-23 19:12:29] [INFO ] Redundant transitions in 30 ms returned []
Running 1308 sub problems to find dead transitions.
[2024-05-23 19:12:29] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:12:29] [INFO ] Invariant cache hit.
[2024-05-23 19:12:29] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 3 (OVERLAPS) 755/1215 variables, 460/462 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
SMT process timed out in 35064ms, After SMT, problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 35079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36880 ms. Remains : 460/460 places, 1310/1310 transitions.
[2024-05-23 19:13:04] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {222=1, 348=1, 551=1, 742=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {255=1, 381=1, 584=1, 744=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :[1, 3, 0, 2, 4, 4, 3, 2, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[63, 134, 62, 114, 840, 140, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:13:04] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:13:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[63, 134, 62, 114, 840, 140, 91, 63, 150, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2617 ms. (381 steps per ms)
BEST_FIRST walk for 10000010 steps (21 resets) in 15159 ms. (659 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63, 134, 62, 114, 871, 148, 91, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:13:22] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:13:22] [INFO ] Invariant cache hit.
[2024-05-23 19:13:22] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:13:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:13:22] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-23 19:13:22] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:13:22] [INFO ] [Real]Added 92 Read/Feed constraints in 45 ms returned sat
[2024-05-23 19:13:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:13:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:13:22] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-23 19:13:22] [INFO ] [Nat]Added 92 Read/Feed constraints in 37 ms returned sat
[2024-05-23 19:13:22] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 77 ms.
[2024-05-23 19:13:23] [INFO ] Added : 1 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 462 ms.
[2024-05-23 19:13:23] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:13:23] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 19:13:23] [INFO ] [Real]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:13:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:13:24] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:13:24] [INFO ] [Nat]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:13:24] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 67 ms.
[2024-05-23 19:13:24] [INFO ] Added : 16 causal constraints over 5 iterations in 307 ms. Result :sat
Minimization took 450 ms.
[2024-05-23 19:13:24] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:13:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:13:25] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-23 19:13:25] [INFO ] [Real]Added 92 Read/Feed constraints in 41 ms returned sat
[2024-05-23 19:13:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:13:25] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:13:25] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:13:25] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 81 ms.
[2024-05-23 19:13:25] [INFO ] Added : 1 causal constraints over 1 iterations in 186 ms. Result :sat
Minimization took 444 ms.
[2024-05-23 19:13:26] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:13:26] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 19:13:26] [INFO ] [Real]Added 92 Read/Feed constraints in 47 ms returned sat
[2024-05-23 19:13:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:13:26] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:13:26] [INFO ] [Nat]Added 92 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:13:26] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 80 ms.
[2024-05-23 19:13:27] [INFO ] Added : 15 causal constraints over 5 iterations in 324 ms. Result :sat
Minimization took 436 ms.
[2024-05-23 19:13:27] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:13:27] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:13:27] [INFO ] [Real]Added 92 Read/Feed constraints in 51 ms returned sat
[2024-05-23 19:13:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:13:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:13:28] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 19:13:28] [INFO ] [Nat]Added 92 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:13:28] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 77 ms.
[2024-05-23 19:13:28] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 525 ms.
[2024-05-23 19:13:28] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:13:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:13:29] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:13:29] [INFO ] [Real]Added 92 Read/Feed constraints in 36 ms returned sat
[2024-05-23 19:13:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:13:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:13:29] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 19:13:29] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:13:29] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 80 ms.
[2024-05-23 19:13:29] [INFO ] Added : 14 causal constraints over 4 iterations in 286 ms. Result :sat
Minimization took 442 ms.
[2024-05-23 19:13:30] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:13:30] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:13:30] [INFO ] [Real]Added 92 Read/Feed constraints in 38 ms returned sat
[2024-05-23 19:13:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:13:30] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-23 19:13:30] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:13:30] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 80 ms.
[2024-05-23 19:13:31] [INFO ] Added : 13 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 439 ms.
[2024-05-23 19:13:31] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:13:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:13:31] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 19:13:31] [INFO ] [Real]Added 92 Read/Feed constraints in 56 ms returned sat
[2024-05-23 19:13:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:13:32] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-23 19:13:32] [INFO ] [Nat]Added 92 Read/Feed constraints in 58 ms returned sat
[2024-05-23 19:13:32] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 72 ms.
[2024-05-23 19:13:32] [INFO ] Added : 2 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 539 ms.
[2024-05-23 19:13:33] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:13:33] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 19:13:33] [INFO ] [Real]Added 92 Read/Feed constraints in 27 ms returned sat
[2024-05-23 19:13:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:13:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:13:33] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:13:33] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:13:33] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 70 ms.
[2024-05-23 19:13:33] [INFO ] Added : 1 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 513 ms.
[2024-05-23 19:13:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:13:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:13:34] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 19:13:34] [INFO ] [Real]Added 92 Read/Feed constraints in 27 ms returned sat
[2024-05-23 19:13:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:13:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:13:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:13:34] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-23 19:13:34] [INFO ] [Nat]Added 92 Read/Feed constraints in 22 ms returned sat
[2024-05-23 19:13:35] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 70 ms.
[2024-05-23 19:13:35] [INFO ] Added : 16 causal constraints over 4 iterations in 283 ms. Result :sat
Minimization took 515 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63, 134, 62, 114, 871, 148, 91, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63, 134, 62, 114, 871, 148, 91, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 61 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 460/460 places, 1310/1310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 61 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2024-05-23 19:13:36] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:13:36] [INFO ] Invariant cache hit.
[2024-05-23 19:13:37] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-23 19:13:37] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:13:37] [INFO ] Invariant cache hit.
[2024-05-23 19:13:37] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:13:38] [INFO ] Implicit Places using invariants and state equation in 1346 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2024-05-23 19:13:38] [INFO ] Redundant transitions in 24 ms returned []
Running 1308 sub problems to find dead transitions.
[2024-05-23 19:13:38] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:13:38] [INFO ] Invariant cache hit.
[2024-05-23 19:13:38] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 3 (OVERLAPS) 755/1215 variables, 460/462 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
SMT process timed out in 35191ms, After SMT, problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 35210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36983 ms. Remains : 460/460 places, 1310/1310 transitions.
[2024-05-23 19:14:13] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {222=1, 348=1, 551=1, 742=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {255=1, 381=1, 584=1, 744=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :[1, 2, 1, 4, 4, 5, 0, 1, 2, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[63, 134, 62, 114, 871, 148, 91, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:14:13] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:14:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[63, 134, 62, 114, 871, 148, 91, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2400 ms. (416 steps per ms)
BEST_FIRST walk for 10000010 steps (27 resets) in 14740 ms. (678 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:14:31] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:14:31] [INFO ] Invariant cache hit.
[2024-05-23 19:14:31] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:14:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:31] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 19:14:31] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:14:31] [INFO ] [Real]Added 92 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:14:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:14:31] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 19:14:31] [INFO ] [Nat]Added 92 Read/Feed constraints in 35 ms returned sat
[2024-05-23 19:14:31] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 79 ms.
[2024-05-23 19:14:31] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 445 ms.
[2024-05-23 19:14:32] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:14:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:32] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 19:14:32] [INFO ] [Real]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:14:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:14:32] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 19:14:32] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:14:33] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 65 ms.
[2024-05-23 19:14:33] [INFO ] Added : 16 causal constraints over 5 iterations in 310 ms. Result :sat
Minimization took 525 ms.
[2024-05-23 19:14:33] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:14:34] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:14:34] [INFO ] [Real]Added 92 Read/Feed constraints in 40 ms returned sat
[2024-05-23 19:14:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:14:34] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-23 19:14:34] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:14:34] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:14:34] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 504 ms.
[2024-05-23 19:14:35] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:14:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:35] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 19:14:35] [INFO ] [Real]Added 92 Read/Feed constraints in 46 ms returned sat
[2024-05-23 19:14:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:14:35] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 19:14:35] [INFO ] [Nat]Added 92 Read/Feed constraints in 43 ms returned sat
[2024-05-23 19:14:35] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 65 ms.
[2024-05-23 19:14:36] [INFO ] Added : 15 causal constraints over 5 iterations in 315 ms. Result :sat
Minimization took 439 ms.
[2024-05-23 19:14:36] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:14:36] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 19:14:36] [INFO ] [Real]Added 92 Read/Feed constraints in 54 ms returned sat
[2024-05-23 19:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:37] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 19:14:37] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:14:37] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 68 ms.
[2024-05-23 19:14:37] [INFO ] Added : 1 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 444 ms.
[2024-05-23 19:14:37] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:14:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:38] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 19:14:38] [INFO ] [Real]Added 92 Read/Feed constraints in 40 ms returned sat
[2024-05-23 19:14:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:14:38] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 19:14:38] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:14:38] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:14:38] [INFO ] Added : 14 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 498 ms.
[2024-05-23 19:14:39] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:14:39] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:14:39] [INFO ] [Real]Added 92 Read/Feed constraints in 36 ms returned sat
[2024-05-23 19:14:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:39] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 19:14:39] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:14:40] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 125 ms.
[2024-05-23 19:14:40] [INFO ] Added : 13 causal constraints over 4 iterations in 326 ms. Result :sat
Minimization took 443 ms.
[2024-05-23 19:14:40] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:40] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 19:14:40] [INFO ] [Real]Added 92 Read/Feed constraints in 57 ms returned sat
[2024-05-23 19:14:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:41] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 19:14:41] [INFO ] [Nat]Added 92 Read/Feed constraints in 47 ms returned sat
[2024-05-23 19:14:41] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 66 ms.
[2024-05-23 19:14:41] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 467 ms.
[2024-05-23 19:14:42] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:14:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:42] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 19:14:42] [INFO ] [Real]Added 92 Read/Feed constraints in 29 ms returned sat
[2024-05-23 19:14:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:14:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:42] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 19:14:42] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:14:42] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 75 ms.
[2024-05-23 19:14:42] [INFO ] Added : 1 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 491 ms.
[2024-05-23 19:14:43] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:14:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:14:43] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-23 19:14:43] [INFO ] [Real]Added 92 Read/Feed constraints in 28 ms returned sat
[2024-05-23 19:14:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:14:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:14:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:14:43] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:14:43] [INFO ] [Nat]Added 92 Read/Feed constraints in 21 ms returned sat
[2024-05-23 19:14:43] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 74 ms.
[2024-05-23 19:14:44] [INFO ] Added : 16 causal constraints over 4 iterations in 289 ms. Result :sat
Minimization took 456 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 55 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 460/460 places, 1310/1310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 55 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2024-05-23 19:14:45] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:14:45] [INFO ] Invariant cache hit.
[2024-05-23 19:14:45] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-23 19:14:45] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:14:45] [INFO ] Invariant cache hit.
[2024-05-23 19:14:46] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:14:47] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2024-05-23 19:14:47] [INFO ] Redundant transitions in 19 ms returned []
Running 1308 sub problems to find dead transitions.
[2024-05-23 19:14:47] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:14:47] [INFO ] Invariant cache hit.
[2024-05-23 19:14:47] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 3 (OVERLAPS) 755/1215 variables, 460/462 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
SMT process timed out in 34743ms, After SMT, problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 34758ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36572 ms. Remains : 460/460 places, 1310/1310 transitions.
[2024-05-23 19:15:22] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {222=1, 348=1, 551=1, 742=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {255=1, 381=1, 584=1, 744=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 10) seen :[1, 2, 4, 3, 7, 3, 2, 2, 2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:15:22] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:15:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2454 ms. (407 steps per ms)
BEST_FIRST walk for 10000010 steps (25 resets) in 14820 ms. (674 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 19:15:39] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:15:39] [INFO ] Invariant cache hit.
[2024-05-23 19:15:39] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:15:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:39] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 19:15:39] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:15:39] [INFO ] [Real]Added 92 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:15:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:15:40] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-23 19:15:40] [INFO ] [Nat]Added 92 Read/Feed constraints in 36 ms returned sat
[2024-05-23 19:15:40] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 70 ms.
[2024-05-23 19:15:40] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 484 ms.
[2024-05-23 19:15:41] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:41] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-23 19:15:41] [INFO ] [Real]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:15:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:15:41] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:15:41] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:15:41] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 19:15:41] [INFO ] Added : 16 causal constraints over 5 iterations in 307 ms. Result :sat
Minimization took 477 ms.
[2024-05-23 19:15:42] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:42] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:15:42] [INFO ] [Real]Added 92 Read/Feed constraints in 40 ms returned sat
[2024-05-23 19:15:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:15:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:42] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 19:15:42] [INFO ] [Nat]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:15:43] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 77 ms.
[2024-05-23 19:15:43] [INFO ] Added : 1 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 471 ms.
[2024-05-23 19:15:43] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:15:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:43] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 19:15:43] [INFO ] [Real]Added 92 Read/Feed constraints in 48 ms returned sat
[2024-05-23 19:15:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:15:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:44] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-23 19:15:44] [INFO ] [Nat]Added 92 Read/Feed constraints in 43 ms returned sat
[2024-05-23 19:15:44] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 80 ms.
[2024-05-23 19:15:44] [INFO ] Added : 15 causal constraints over 5 iterations in 322 ms. Result :sat
Minimization took 465 ms.
[2024-05-23 19:15:45] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:45] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 19:15:45] [INFO ] [Real]Added 92 Read/Feed constraints in 52 ms returned sat
[2024-05-23 19:15:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-23 19:15:45] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:15:45] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:15:45] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:15:45] [INFO ] Added : 1 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 474 ms.
[2024-05-23 19:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:15:46] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 19:15:46] [INFO ] [Real]Added 92 Read/Feed constraints in 35 ms returned sat
[2024-05-23 19:15:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:15:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:15:46] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 19:15:46] [INFO ] [Nat]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:15:47] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 77 ms.
[2024-05-23 19:15:47] [INFO ] Added : 14 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 483 ms.
[2024-05-23 19:15:47] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 19:15:48] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 19:15:48] [INFO ] [Real]Added 92 Read/Feed constraints in 38 ms returned sat
[2024-05-23 19:15:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:48] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-23 19:15:48] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:15:48] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 74 ms.
[2024-05-23 19:15:48] [INFO ] Added : 13 causal constraints over 4 iterations in 283 ms. Result :sat
Minimization took 486 ms.
[2024-05-23 19:15:49] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:49] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-23 19:15:49] [INFO ] [Real]Added 92 Read/Feed constraints in 56 ms returned sat
[2024-05-23 19:15:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:15:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:49] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:15:49] [INFO ] [Nat]Added 92 Read/Feed constraints in 53 ms returned sat
[2024-05-23 19:15:49] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 80 ms.
[2024-05-23 19:15:50] [INFO ] Added : 2 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 492 ms.
[2024-05-23 19:15:50] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:50] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 19:15:50] [INFO ] [Real]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:15:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:15:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:51] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:15:51] [INFO ] [Nat]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:15:51] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:15:51] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 480 ms.
[2024-05-23 19:15:51] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:15:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:15:52] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:15:52] [INFO ] [Real]Added 92 Read/Feed constraints in 26 ms returned sat
[2024-05-23 19:15:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:15:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:15:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:15:52] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 19:15:52] [INFO ] [Nat]Added 92 Read/Feed constraints in 21 ms returned sat
[2024-05-23 19:15:52] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 19:15:52] [INFO ] Added : 16 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 490 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 52 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 460/460 places, 1310/1310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 53 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2024-05-23 19:15:54] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:15:54] [INFO ] Invariant cache hit.
[2024-05-23 19:15:54] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-23 19:15:54] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:15:54] [INFO ] Invariant cache hit.
[2024-05-23 19:15:54] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:15:55] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
[2024-05-23 19:15:55] [INFO ] Redundant transitions in 23 ms returned []
Running 1308 sub problems to find dead transitions.
[2024-05-23 19:15:55] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:15:55] [INFO ] Invariant cache hit.
[2024-05-23 19:15:55] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 755/1215 variables, 460/462 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
SMT process timed out in 35209ms, After SMT, problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 35223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36965 ms. Remains : 460/460 places, 1310/1310 transitions.
[2024-05-23 19:16:30] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
Found an invariant !
This invariant on transitions {222=1, 348=1, 551=1, 742=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {255=1, 381=1, 584=1, 744=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :[0, 4, 2, 3, 8, 4, 0, 5, 2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40002 steps (8 resets) in 1945 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 248 ms. (160 steps per ms) remains 12/12 properties
[2024-05-23 19:16:32] [INFO ] Flatten gal took : 298 ms
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
[2024-05-23 19:16:32] [INFO ] Flatten gal took : 198 ms
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 379 ms. (105 steps per ms) remains 12/12 properties
[2024-05-23 19:16:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2550048877805623638.gal : 57 ms
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
[2024-05-23 19:16:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12361273415792067663.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/ReachabilityCardinality2550048877805623638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12361273415792067663.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality12361273415792067663.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 144954 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 12
Probabilistic random walk after 144954 steps, saw 88904 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-23 19:16:35] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:16:35] [INFO ] Invariant cache hit.
[2024-05-23 19:16:35] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 382/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 662/1054 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1054 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1054 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 89/1143 variables, 22/417 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1143 variables, 83/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1143 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 12/1155 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1155 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1155 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 49/1204 variables, 35/538 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1204 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1204 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 11/1215 variables, 9/554 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1215 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/1215 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1215/1215 variables, and 554 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 460/460 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 382/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 662/1054 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1054 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1054 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 89/1143 variables, 22/417 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1143 variables, 83/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1143 variables, 12/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:16:38] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1143 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1143 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 12/1155 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1155 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1155 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 49/1204 variables, 35/551 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1204 variables, 7/558 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 11/1215 variables, 9/567 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1215 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 0/1215 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1215/1215 variables, and 567 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 460/460 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 4654ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Parikh walk visited 0 properties in 30004 ms.
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 66 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 460/460 places, 1310/1310 transitions.
RANDOM walk for 40001 steps (8 resets) in 363 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 139439 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 12
Probabilistic random walk after 139439 steps, saw 85521 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-23 19:17:13] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:17:13] [INFO ] Invariant cache hit.
[2024-05-23 19:17:13] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 382/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 662/1054 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1054 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1054 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 89/1143 variables, 22/417 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1143 variables, 83/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1143 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 12/1155 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1155 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1155 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 49/1204 variables, 35/538 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1204 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1204 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 11/1215 variables, 9/554 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1215 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/1215 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1215/1215 variables, and 554 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 460/460 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 382/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 662/1054 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1054 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1054 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 89/1143 variables, 22/417 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1143 variables, 83/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1143 variables, 12/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
[2024-05-23 19:17:16] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1143 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1143 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 12/1155 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1155 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1155 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 49/1204 variables, 35/551 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1204 variables, 7/558 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 11/1215 variables, 9/567 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1215 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 0/1215 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1215/1215 variables, and 567 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 460/460 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 4491ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Detected timeout of ITS tools.
[2024-05-23 19:17:22] [INFO ] Flatten gal took : 337 ms
[2024-05-23 19:17:22] [INFO ] Applying decomposition
[2024-05-23 19:17:23] [INFO ] Flatten gal took : 198 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/graph8256728310675833466.txt' '-o' '/tmp/graph8256728310675833466.bin' '-w' '/tmp/graph8256728310675833466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8256728310675833466.bin' '-l' '-1' '-v' '-w' '/tmp/graph8256728310675833466.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:17:23] [INFO ] Decomposing Gal with order
[2024-05-23 19:17:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:17:23] [INFO ] Removed a total of 2253 redundant transitions.
[2024-05-23 19:17:23] [INFO ] Flatten gal took : 298 ms
[2024-05-23 19:17:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 933 labels/synchronizations in 135 ms.
[2024-05-23 19:17:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10804289238643339743.gal : 15 ms
[2024-05-23 19:17:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4146185315670790890.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10804289238643339743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4146185315670790890.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/ReachabilityCardinality4146185315670790890.prop.
Parikh walk visited 0 properties in 30001 ms.
Support contains 10 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 57 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 460/460 places, 1310/1310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Applied a total of 0 rules in 57 ms. Remains 460 /460 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2024-05-23 19:17:48] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:17:48] [INFO ] Invariant cache hit.
[2024-05-23 19:17:48] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-23 19:17:48] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:17:48] [INFO ] Invariant cache hit.
[2024-05-23 19:17:48] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:17:50] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
[2024-05-23 19:17:50] [INFO ] Redundant transitions in 19 ms returned []
Running 1308 sub problems to find dead transitions.
[2024-05-23 19:17:50] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:17:50] [INFO ] Invariant cache hit.
[2024-05-23 19:17:50] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 3 (OVERLAPS) 755/1215 variables, 460/462 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
SMT process timed out in 35405ms, After SMT, problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 35421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37292 ms. Remains : 460/460 places, 1310/1310 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[63, 134, 62, 114, 871, 236, 180, 63, 210, 86] Max Struct:[64, +inf, 64, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c064-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
[2024-05-23 19:18:25] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:18:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10000 steps (2 resets) in 30 ms. (322 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[64]
[2024-05-23 19:18:25] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:18:25] [INFO ] Invariant cache hit.
[2024-05-23 19:18:25] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:18:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:18:25] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:18:25] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:18:25] [INFO ] [Real]Added 92 Read/Feed constraints in 48 ms returned sat
[2024-05-23 19:18:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:18:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:18:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:18:26] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-23 19:18:26] [INFO ] [Nat]Added 92 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:18:26] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 85 ms.
[2024-05-23 19:18:26] [INFO ] Added : 1 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 487 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[64]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Graph (complete) has 2241 edges and 460 vertex of which 457 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 457 transition count 1304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 450 transition count 1290
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 450 transition count 1290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 450 transition count 1284
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 33 place count 444 transition count 1270
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 444 transition count 1270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 444 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 439 transition count 1256
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 439 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 58 place count 434 transition count 1244
Iterating global reduction 3 with 5 rules applied. Total rules applied 63 place count 434 transition count 1244
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 68 place count 429 transition count 1232
Iterating global reduction 3 with 5 rules applied. Total rules applied 73 place count 429 transition count 1232
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 78 place count 424 transition count 1222
Iterating global reduction 3 with 5 rules applied. Total rules applied 83 place count 424 transition count 1222
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 421 transition count 1216
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 421 transition count 1216
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 418 transition count 1210
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 418 transition count 1210
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 416 transition count 1206
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 416 transition count 1206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 414 transition count 1202
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 413 transition count 1200
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 413 transition count 1200
Applied a total of 105 rules in 181 ms. Remains 413 /460 variables (removed 47) and now considering 1200/1310 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 413/460 places, 1200/1310 transitions.
[2024-05-23 19:18:27] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-23 19:18:27] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[64]
RANDOM walk for 1000004 steps (2 resets) in 2200 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1176 ms. (849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[64]
[2024-05-23 19:18:30] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:18:30] [INFO ] Invariant cache hit.
[2024-05-23 19:18:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:18:30] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 19:18:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 19:18:30] [INFO ] [Real]Added 72 Read/Feed constraints in 51 ms returned sat
[2024-05-23 19:18:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:18:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:18:31] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:18:31] [INFO ] [Nat]Added 72 Read/Feed constraints in 38 ms returned sat
[2024-05-23 19:18:31] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 72 ms.
[2024-05-23 19:18:31] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[64]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 49 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 49 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 19:18:31] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:18:31] [INFO ] Invariant cache hit.
[2024-05-23 19:18:32] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-23 19:18:32] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:18:32] [INFO ] Invariant cache hit.
[2024-05-23 19:18:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 19:18:33] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1676 ms to find 0 implicit places.
[2024-05-23 19:18:33] [INFO ] Redundant transitions in 19 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 19:18:33] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:18:33] [INFO ] Invariant cache hit.
[2024-05-23 19:18:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-23 19:18:51] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 34264ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 34277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36036 ms. Remains : 413/413 places, 1200/1200 transitions.
[2024-05-23 19:19:07] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:19:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[64] Max Struct:[64]
FORMULA FunctionPointer-PT-c064-UpperBounds-01 64 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000002 steps (2 resets) in 2116 ms. (472 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-23 19:19:10] [INFO ] Flatten gal took : 50 ms
[2024-05-23 19:19:10] [INFO ] Flatten gal took : 41 ms
[2024-05-23 19:19:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality657877999387428840.gal : 10 ms
[2024-05-23 19:19:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11553838388041870972.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/ReachabilityCardinality657877999387428840.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11553838388041870972.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
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
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-01 in 44529 ms.
Starting property specific reduction for FunctionPointer-PT-c064-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:19:10] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:19:10] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:19:10] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:19:10] [INFO ] Invariant cache hit.
[2024-05-23 19:19:10] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:19:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:19:10] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 19:19:10] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:19:10] [INFO ] [Real]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:19:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:19:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:19:10] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:19:10] [INFO ] [Nat]Added 92 Read/Feed constraints in 35 ms returned sat
[2024-05-23 19:19:10] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 73 ms.
[2024-05-23 19:19:11] [INFO ] Added : 14 causal constraints over 4 iterations in 300 ms. Result :sat
Minimization took 482 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Graph (complete) has 2241 edges and 460 vertex of which 457 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 451 transition count 1292
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 451 transition count 1292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 451 transition count 1286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 446 transition count 1274
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 446 transition count 1274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 446 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 442 transition count 1262
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 438 transition count 1252
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 438 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 59 place count 434 transition count 1242
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 434 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 430 transition count 1234
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 430 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 427 transition count 1228
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 427 transition count 1228
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 424 transition count 1222
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 424 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 422 transition count 1218
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 422 transition count 1218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 420 transition count 1214
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 419 transition count 1212
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 419 transition count 1212
Applied a total of 93 rules in 163 ms. Remains 419 /460 variables (removed 41) and now considering 1212/1310 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 419/460 places, 1212/1310 transitions.
[2024-05-23 19:19:11] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 19:19:12] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-23 19:19:12] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2226 ms. (449 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1302 ms. (767 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[532] Max Struct:[+inf]
[2024-05-23 19:19:15] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:19:15] [INFO ] Invariant cache hit.
[2024-05-23 19:19:15] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 19:19:15] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 19:19:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:19:16] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:19:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:19:16] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 19:19:16] [INFO ] [Nat]Added 75 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:19:16] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 3 ms to minimize.
[2024-05-23 19:19:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-05-23 19:19:16] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 64 ms.
[2024-05-23 19:19:16] [INFO ] Added : 17 causal constraints over 5 iterations in 327 ms. Result :sat
Minimization took 316 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[532] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[532] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 48 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 48 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 19:19:19] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:19:19] [INFO ] Invariant cache hit.
[2024-05-23 19:19:20] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-23 19:19:20] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:19:20] [INFO ] Invariant cache hit.
[2024-05-23 19:19:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:19:21] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2024-05-23 19:19:21] [INFO ] Redundant transitions in 19 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 19:19:21] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:19:21] [INFO ] Invariant cache hit.
[2024-05-23 19:19:21] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 19:19:40] [INFO ] Deduced a trap composed of 131 places in 102 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34299ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36033 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 19:19:55] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[532] Max Struct:[+inf]
[2024-05-23 19:19:56] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:19:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[532] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2081 ms. (480 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1157 ms. (863 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[532] Max Struct:[+inf]
[2024-05-23 19:19:59] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:19:59] [INFO ] Invariant cache hit.
[2024-05-23 19:19:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:19:59] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 19:19:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:19:59] [INFO ] [Real]Added 75 Read/Feed constraints in 35 ms returned sat
[2024-05-23 19:19:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:19:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:19:59] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-23 19:19:59] [INFO ] [Nat]Added 75 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:20:00] [INFO ] Deduced a trap composed of 71 places in 205 ms of which 3 ms to minimize.
[2024-05-23 19:20:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-05-23 19:20:00] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 60 ms.
[2024-05-23 19:20:00] [INFO ] Added : 17 causal constraints over 5 iterations in 315 ms. Result :sat
Minimization took 307 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[532] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[532] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 43 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 43 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 19:20:03] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:20:03] [INFO ] Invariant cache hit.
[2024-05-23 19:20:03] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-23 19:20:03] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:20:03] [INFO ] Invariant cache hit.
[2024-05-23 19:20:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:20:05] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
[2024-05-23 19:20:05] [INFO ] Redundant transitions in 21 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 19:20:05] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:20:05] [INFO ] Invariant cache hit.
[2024-05-23 19:20:05] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 19:20:23] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 33696ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 33708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35472 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 19:20:38] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[532] Max Struct:[+inf]
[2024-05-23 19:20:39] [INFO ] Flatten gal took : 38 ms
RANDOM walk for 40006 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2024-05-23 19:20:39] [INFO ] Flatten gal took : 59 ms
[2024-05-23 19:20:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5380476650276276443.gal : 6 ms
[2024-05-23 19:20:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5575234277758452737.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5380476650276276443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5575234277758452737.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/ReachabilityCardinality5575234277758452737.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 451308 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 451308 steps, saw 276741 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2024-05-23 19:20:42] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:20:42] [INFO ] Invariant cache hit.
[2024-05-23 19:20:42] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2328 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 50 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 419/419 places, 1212/1212 transitions.
RANDOM walk for 40005 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 455535 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 1
Probabilistic random walk after 455535 steps, saw 279332 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2024-05-23 19:20:48] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:20:48] [INFO ] Invariant cache hit.
[2024-05-23 19:20:48] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2351 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 55 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 46 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 19:20:51] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:20:51] [INFO ] Invariant cache hit.
[2024-05-23 19:20:51] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-23 19:20:51] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:20:51] [INFO ] Invariant cache hit.
[2024-05-23 19:20:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:20:53] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
[2024-05-23 19:20:53] [INFO ] Redundant transitions in 21 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 19:20:53] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:20:53] [INFO ] Invariant cache hit.
[2024-05-23 19:20:53] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 19:21:12] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34804ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34820ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36479 ms. Remains : 419/419 places, 1212/1212 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 419 transition count 673
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 551 place count 407 transition count 673
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 551 place count 407 transition count 604
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 689 place count 338 transition count 604
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 945 place count 210 transition count 476
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1009 place count 146 transition count 348
Iterating global reduction 2 with 64 rules applied. Total rules applied 1073 place count 146 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1074 place count 146 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1074 place count 146 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1076 place count 145 transition count 346
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1139 place count 82 transition count 220
Iterating global reduction 3 with 63 rules applied. Total rules applied 1202 place count 82 transition count 220
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1265 place count 19 transition count 94
Iterating global reduction 3 with 63 rules applied. Total rules applied 1328 place count 19 transition count 94
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1391 place count 19 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1391 place count 19 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1393 place count 18 transition count 30
Applied a total of 1393 rules in 85 ms. Remains 18 /419 variables (removed 401) and now considering 30/1212 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2024-05-23 19:21:27] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 19:21:27] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:21:28] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:21:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:21:28] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:21:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:21:28] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:21:28] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:21:28] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:21:28] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:21:28] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:21:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18135269128427571032.gal : 1 ms
[2024-05-23 19:21:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1434155560676284985.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/ReachabilityCardinality18135269128427571032.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1434155560676284985.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/ReachabilityCardinality1434155560676284985.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 35107
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35107 after 6.2298e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.2298e+06 after 1.79901e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.79901e+07 after 4.1465e+07
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.1465e+07 after 8.8369e+07
[2024-05-23 19:21:29] [INFO ] Flatten gal took : 32 ms
[2024-05-23 19:21:29] [INFO ] Applying decomposition
[2024-05-23 19:21:29] [INFO ] Flatten gal took : 32 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/graph17316778319124281230.txt' '-o' '/tmp/graph17316778319124281230.bin' '-w' '/tmp/graph17316778319124281230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17316778319124281230.bin' '-l' '-1' '-v' '-w' '/tmp/graph17316778319124281230.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:21:29] [INFO ] Decomposing Gal with order
[2024-05-23 19:21:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:21:29] [INFO ] Removed a total of 2073 redundant transitions.
[2024-05-23 19:21:29] [INFO ] Flatten gal took : 119 ms
[2024-05-23 19:21:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 830 labels/synchronizations in 106 ms.
[2024-05-23 19:21:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17242855260134421692.gal : 22 ms
[2024-05-23 19:21:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12453696128158479688.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17242855260134421692.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12453696128158479688.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/ReachabilityCardinality12453696128158479688.prop.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.8369e+07 after 1.82131e+08
Detected timeout of ITS tools.
[2024-05-23 19:21:43] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:21:43] [INFO ] Applying decomposition
[2024-05-23 19:21:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17239791761554807799.txt' '-o' '/tmp/graph17239791761554807799.bin' '-w' '/tmp/graph17239791761554807799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17239791761554807799.bin' '-l' '-1' '-v' '-w' '/tmp/graph17239791761554807799.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:21:43] [INFO ] Decomposing Gal with order
[2024-05-23 19:21:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:21:43] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-23 19:21:43] [INFO ] Flatten gal took : 2 ms
[2024-05-23 19:21:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-23 19:21:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality536440391077239012.gal : 1 ms
[2024-05-23 19:21:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8252766745265711921.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/ReachabilityCardinality536440391077239012.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8252766745265711921.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 ...306
Loading property file /tmp/ReachabilityCardinality8252766745265711921.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30291 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:[532] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-02 in 168058 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
[2024-05-23 19:21:58] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:21:58] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10004 steps (2 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2024-05-23 19:21:58] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:21:58] [INFO ] Invariant cache hit.
[2024-05-23 19:21:58] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:21:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:21:58] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 19:21:58] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:21:58] [INFO ] [Real]Added 92 Read/Feed constraints in 26 ms returned sat
[2024-05-23 19:21:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:21:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:21:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:21:58] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 19:21:58] [INFO ] [Nat]Added 92 Read/Feed constraints in 37 ms returned sat
[2024-05-23 19:21:58] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 75 ms.
[2024-05-23 19:21:58] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 464 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[62] Max Struct:[64]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Graph (complete) has 2241 edges and 460 vertex of which 457 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 457 transition count 1304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 450 transition count 1290
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 450 transition count 1290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 450 transition count 1284
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 33 place count 444 transition count 1270
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 444 transition count 1270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 444 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 439 transition count 1256
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 439 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 58 place count 434 transition count 1244
Iterating global reduction 3 with 5 rules applied. Total rules applied 63 place count 434 transition count 1244
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 68 place count 429 transition count 1232
Iterating global reduction 3 with 5 rules applied. Total rules applied 73 place count 429 transition count 1232
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 78 place count 424 transition count 1222
Iterating global reduction 3 with 5 rules applied. Total rules applied 83 place count 424 transition count 1222
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 421 transition count 1216
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 421 transition count 1216
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 418 transition count 1210
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 418 transition count 1210
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 416 transition count 1206
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 416 transition count 1206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 414 transition count 1202
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 413 transition count 1200
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 413 transition count 1200
Applied a total of 105 rules in 162 ms. Remains 413 /460 variables (removed 47) and now considering 1200/1310 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 413/460 places, 1200/1310 transitions.
[2024-05-23 19:21:59] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-23 19:21:59] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[62] Max Struct:[64]
RANDOM walk for 1000000 steps (2 resets) in 2209 ms. (452 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1238 ms. (807 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[62] Max Struct:[64]
[2024-05-23 19:22:03] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:22:03] [INFO ] Invariant cache hit.
[2024-05-23 19:22:03] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:22:03] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 19:22:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 19:22:03] [INFO ] [Real]Added 72 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:22:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:22:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:22:03] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 19:22:03] [INFO ] [Nat]Added 72 Read/Feed constraints in 37 ms returned sat
[2024-05-23 19:22:04] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 68 ms.
[2024-05-23 19:22:04] [INFO ] Added : 3 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[62] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63] Max Struct:[64]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 51 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 68 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 19:22:04] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:22:04] [INFO ] Invariant cache hit.
[2024-05-23 19:22:05] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-23 19:22:05] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:22:05] [INFO ] Invariant cache hit.
[2024-05-23 19:22:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 19:22:06] [INFO ] Implicit Places using invariants and state equation in 1269 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
[2024-05-23 19:22:06] [INFO ] Redundant transitions in 17 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 19:22:06] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:22:06] [INFO ] Invariant cache hit.
[2024-05-23 19:22:06] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-23 19:22:25] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 34759ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 34774ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36651 ms. Remains : 413/413 places, 1200/1200 transitions.
[2024-05-23 19:22:41] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:22:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[63] Max Struct:[64]
RANDOM walk for 1000000 steps (2 resets) in 2072 ms. (482 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1207 ms. (827 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63] Max Struct:[64]
[2024-05-23 19:22:44] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:22:44] [INFO ] Invariant cache hit.
[2024-05-23 19:22:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:22:44] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 19:22:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 19:22:44] [INFO ] [Real]Added 72 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:22:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:22:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:22:45] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 19:22:45] [INFO ] [Nat]Added 72 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:22:45] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 74 ms.
[2024-05-23 19:22:45] [INFO ] Added : 3 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63] Max Struct:[64]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 54 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 45 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 19:22:45] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:22:45] [INFO ] Invariant cache hit.
[2024-05-23 19:22:46] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-23 19:22:46] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:22:46] [INFO ] Invariant cache hit.
[2024-05-23 19:22:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 19:22:47] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
[2024-05-23 19:22:47] [INFO ] Redundant transitions in 19 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 19:22:47] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:22:47] [INFO ] Invariant cache hit.
[2024-05-23 19:22:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-23 19:23:06] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 34469ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 34480ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36133 ms. Remains : 413/413 places, 1200/1200 transitions.
RANDOM walk for 40006 steps (8 resets) in 126 ms. (315 steps per ms) remains 2/2 properties
[2024-05-23 19:23:22] [INFO ] Flatten gal took : 51 ms
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
[2024-05-23 19:23:22] [INFO ] Flatten gal took : 57 ms
[2024-05-23 19:23:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13239101273979611860.gal : 7 ms
[2024-05-23 19:23:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6529840980733946593.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/ReachabilityCardinality13239101273979611860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6529840980733946593.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/ReachabilityCardinality6529840980733946593.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 287696 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287696 steps, saw 176425 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-05-23 19:23:25] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:23:25] [INFO ] Invariant cache hit.
[2024-05-23 19:23:25] [INFO ] State equation strengthened by 72 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) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/1049 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1066 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1074 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/1082 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/1088 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 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) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1049 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/1066 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1074 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1082 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/1088 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1102ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 809 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 45 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 413/413 places, 1200/1200 transitions.
RANDOM walk for 40007 steps (8 resets) in 456 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 267779 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 2
Probabilistic random walk after 267779 steps, saw 164212 distinct states, run finished after 3003 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-23 19:23:30] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:23:30] [INFO ] Invariant cache hit.
[2024-05-23 19:23:30] [INFO ] State equation strengthened by 72 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) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/1049 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1066 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1074 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/1082 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/1088 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 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) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1049 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/1066 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1074 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1082 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/1088 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1104ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1137 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 57 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 67 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 19:23:32] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:23:32] [INFO ] Invariant cache hit.
[2024-05-23 19:23:32] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-23 19:23:32] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:23:32] [INFO ] Invariant cache hit.
[2024-05-23 19:23:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 19:23:34] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
[2024-05-23 19:23:34] [INFO ] Redundant transitions in 19 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 19:23:34] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 19:23:34] [INFO ] Invariant cache hit.
[2024-05-23 19:23:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-23 19:23:52] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 34654ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 34666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36280 ms. Remains : 413/413 places, 1200/1200 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 413 transition count 664
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 402 transition count 664
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 547 place count 402 transition count 596
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 683 place count 334 transition count 596
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 935 place count 208 transition count 470
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 998 place count 145 transition count 344
Iterating global reduction 2 with 63 rules applied. Total rules applied 1061 place count 145 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1062 place count 145 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1062 place count 145 transition count 342
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1064 place count 144 transition count 342
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1126 place count 82 transition count 218
Iterating global reduction 3 with 62 rules applied. Total rules applied 1188 place count 82 transition count 218
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1250 place count 20 transition count 94
Iterating global reduction 3 with 62 rules applied. Total rules applied 1312 place count 20 transition count 94
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1374 place count 20 transition count 32
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 4 with 2 rules applied. Total rules applied 1376 place count 19 transition count 33
Applied a total of 1376 rules in 26 ms. Remains 19 /413 variables (removed 394) and now considering 33/1200 (removed 1167) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 19:24:08] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 19:24:08] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:24:08] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 19:24:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 19:24:09] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 19:24:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:24:09] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 19:24:09] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 19:24:09] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-23 19:24:09] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:24:09] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:24:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7847651764126815178.gal : 0 ms
[2024-05-23 19:24:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15240824882498913600.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7847651764126815178.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15240824882498913600.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/ReachabilityCardinality15240824882498913600.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :315 after 11915
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :11915 after 5.28021e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.28021e+06 after 5.23649e+08
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 513 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,6.56569e+11,0.368127,13116,2,1265,14,44308,6,0,109,41947,0
Total reachable state count : 656568588387
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,4,0.368573,13116,2,23,14,44308,7,0,112,41947,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,4,0.368975,13116,2,23,14,44308,8,0,113,41947,0
Over-approximation ignoring read arcs solved 0 properties in 488 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 19:24:09] [INFO ] Flatten gal took : 27 ms
[2024-05-23 19:24:09] [INFO ] Applying decomposition
[2024-05-23 19:24:09] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9499633379620191284.txt' '-o' '/tmp/graph9499633379620191284.bin' '-w' '/tmp/graph9499633379620191284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9499633379620191284.bin' '-l' '-1' '-v' '-w' '/tmp/graph9499633379620191284.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:24:09] [INFO ] Decomposing Gal with order
[2024-05-23 19:24:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:24:09] [INFO ] Removed a total of 2053 redundant transitions.
[2024-05-23 19:24:09] [INFO ] Flatten gal took : 63 ms
[2024-05-23 19:24:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 829 labels/synchronizations in 36 ms.
[2024-05-23 19:24:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2625626854689084961.gal : 6 ms
[2024-05-23 19:24:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6235590851067274645.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/ReachabilityCardinality2625626854689084961.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6235590851067274645.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/ReachabilityCardinality6235590851067274645.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[63] Max Struct:[64]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-03 in 181624 ms.
Starting property specific reduction for FunctionPointer-PT-c064-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:24:59] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:24:59] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:24:59] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:24:59] [INFO ] Invariant cache hit.
[2024-05-23 19:24:59] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:24:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:25:00] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 19:25:00] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:25:00] [INFO ] [Real]Added 92 Read/Feed constraints in 25 ms returned sat
[2024-05-23 19:25:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:25:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:25:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:25:00] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:25:00] [INFO ] [Nat]Added 92 Read/Feed constraints in 31 ms returned sat
[2024-05-23 19:25:00] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 94 ms.
[2024-05-23 19:25:00] [INFO ] Added : 15 causal constraints over 5 iterations in 332 ms. Result :sat
Minimization took 487 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Graph (complete) has 2241 edges and 460 vertex of which 457 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 451 transition count 1292
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 451 transition count 1292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 451 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 446 transition count 1276
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 446 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 446 transition count 1272
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 41 place count 442 transition count 1264
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 442 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 438 transition count 1256
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 438 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 57 place count 434 transition count 1246
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 434 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 65 place count 430 transition count 1238
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 430 transition count 1238
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 428 transition count 1234
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 428 transition count 1234
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 426 transition count 1230
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 426 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 425 transition count 1228
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 425 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 424 transition count 1226
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 423 transition count 1224
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 423 transition count 1224
Applied a total of 83 rules in 159 ms. Remains 423 /460 variables (removed 37) and now considering 1224/1310 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 423/460 places, 1224/1310 transitions.
[2024-05-23 19:25:01] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-23 19:25:01] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2024-05-23 19:25:01] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2253 ms. (443 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1246 ms. (801 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[169] Max Struct:[+inf]
[2024-05-23 19:25:05] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:25:05] [INFO ] Invariant cache hit.
[2024-05-23 19:25:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:25:05] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 19:25:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:25:05] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-23 19:25:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:25:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:25:05] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 19:25:05] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 19:25:06] [INFO ] Deduced a trap composed of 113 places in 205 ms of which 3 ms to minimize.
[2024-05-23 19:25:06] [INFO ] Deduced a trap composed of 94 places in 184 ms of which 3 ms to minimize.
[2024-05-23 19:25:06] [INFO ] Deduced a trap composed of 80 places in 178 ms of which 3 ms to minimize.
[2024-05-23 19:25:06] [INFO ] Deduced a trap composed of 78 places in 176 ms of which 3 ms to minimize.
[2024-05-23 19:25:06] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 3 ms to minimize.
[2024-05-23 19:25:07] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 3 ms to minimize.
[2024-05-23 19:25:07] [INFO ] Deduced a trap composed of 78 places in 200 ms of which 3 ms to minimize.
[2024-05-23 19:25:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1473 ms
[2024-05-23 19:25:07] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 68 ms.
[2024-05-23 19:25:07] [INFO ] Added : 24 causal constraints over 6 iterations in 338 ms. Result :sat
Minimization took 277 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[169] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[169] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 45 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 51 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 19:25:09] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:25:09] [INFO ] Invariant cache hit.
[2024-05-23 19:25:09] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-23 19:25:09] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:25:09] [INFO ] Invariant cache hit.
[2024-05-23 19:25:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:25:10] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
[2024-05-23 19:25:10] [INFO ] Redundant transitions in 21 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 19:25:10] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:25:10] [INFO ] Invariant cache hit.
[2024-05-23 19:25:10] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 19:25:31] [INFO ] Deduced a trap composed of 131 places in 92 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34556ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34567ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36286 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 19:25:45] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[169] Max Struct:[+inf]
[2024-05-23 19:25:45] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:25:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[169] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2234 ms. (447 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1283 ms. (778 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[171] Max Struct:[+inf]
[2024-05-23 19:25:49] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:25:49] [INFO ] Invariant cache hit.
[2024-05-23 19:25:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:25:49] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 19:25:49] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:25:49] [INFO ] [Real]Added 75 Read/Feed constraints in 37 ms returned sat
[2024-05-23 19:25:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:25:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:25:49] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 19:25:49] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 19:25:50] [INFO ] Deduced a trap composed of 113 places in 206 ms of which 3 ms to minimize.
[2024-05-23 19:25:50] [INFO ] Deduced a trap composed of 94 places in 204 ms of which 3 ms to minimize.
[2024-05-23 19:25:50] [INFO ] Deduced a trap composed of 80 places in 182 ms of which 3 ms to minimize.
[2024-05-23 19:25:50] [INFO ] Deduced a trap composed of 78 places in 182 ms of which 3 ms to minimize.
[2024-05-23 19:25:50] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 3 ms to minimize.
[2024-05-23 19:25:51] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 2 ms to minimize.
[2024-05-23 19:25:51] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 3 ms to minimize.
[2024-05-23 19:25:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1539 ms
[2024-05-23 19:25:51] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 69 ms.
[2024-05-23 19:25:51] [INFO ] Added : 24 causal constraints over 6 iterations in 375 ms. Result :sat
Minimization took 299 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[171] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[171] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 44 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 45 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 19:25:53] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:25:53] [INFO ] Invariant cache hit.
[2024-05-23 19:25:53] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 19:25:53] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:25:53] [INFO ] Invariant cache hit.
[2024-05-23 19:25:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:25:54] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
[2024-05-23 19:25:54] [INFO ] Redundant transitions in 21 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 19:25:54] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:25:54] [INFO ] Invariant cache hit.
[2024-05-23 19:25:54] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 19:26:16] [INFO ] Deduced a trap composed of 131 places in 99 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 35065ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 35075ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36774 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 19:26:30] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[171] Max Struct:[+inf]
[2024-05-23 19:26:30] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:26:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[171] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2220 ms. (450 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1261 ms. (792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[181] Max Struct:[+inf]
[2024-05-23 19:26:33] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:26:33] [INFO ] Invariant cache hit.
[2024-05-23 19:26:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:26:34] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:26:34] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:26:34] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-23 19:26:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:26:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:26:34] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:26:34] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 19:26:34] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 3 ms to minimize.
[2024-05-23 19:26:34] [INFO ] Deduced a trap composed of 94 places in 190 ms of which 3 ms to minimize.
[2024-05-23 19:26:35] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 8 ms to minimize.
[2024-05-23 19:26:35] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 3 ms to minimize.
[2024-05-23 19:26:35] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 3 ms to minimize.
[2024-05-23 19:26:35] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 3 ms to minimize.
[2024-05-23 19:26:35] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 3 ms to minimize.
[2024-05-23 19:26:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1555 ms
[2024-05-23 19:26:35] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 73 ms.
[2024-05-23 19:26:36] [INFO ] Added : 24 causal constraints over 6 iterations in 351 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[181] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[181] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 46 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 47 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 19:26:37] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:26:37] [INFO ] Invariant cache hit.
[2024-05-23 19:26:38] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 19:26:38] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:26:38] [INFO ] Invariant cache hit.
[2024-05-23 19:26:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:26:39] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
[2024-05-23 19:26:39] [INFO ] Redundant transitions in 22 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 19:26:39] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:26:39] [INFO ] Invariant cache hit.
[2024-05-23 19:26:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 19:27:01] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34892ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34907ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36637 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 19:27:14] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[181] Max Struct:[+inf]
[2024-05-23 19:27:14] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:27:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[181] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2237 ms. (446 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1327 ms. (753 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[181] Max Struct:[+inf]
[2024-05-23 19:27:18] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:27:18] [INFO ] Invariant cache hit.
[2024-05-23 19:27:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:27:18] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 19:27:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:27:18] [INFO ] [Real]Added 75 Read/Feed constraints in 35 ms returned sat
[2024-05-23 19:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:27:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:27:18] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-23 19:27:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 19:27:19] [INFO ] Deduced a trap composed of 113 places in 189 ms of which 3 ms to minimize.
[2024-05-23 19:27:19] [INFO ] Deduced a trap composed of 94 places in 199 ms of which 2 ms to minimize.
[2024-05-23 19:27:19] [INFO ] Deduced a trap composed of 80 places in 191 ms of which 3 ms to minimize.
[2024-05-23 19:27:19] [INFO ] Deduced a trap composed of 78 places in 181 ms of which 3 ms to minimize.
[2024-05-23 19:27:19] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 2 ms to minimize.
[2024-05-23 19:27:20] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 3 ms to minimize.
[2024-05-23 19:27:20] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 3 ms to minimize.
[2024-05-23 19:27:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1524 ms
[2024-05-23 19:27:20] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 81 ms.
[2024-05-23 19:27:20] [INFO ] Added : 24 causal constraints over 6 iterations in 357 ms. Result :sat
Minimization took 292 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[181] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[181] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 51 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 50 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 19:27:22] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:27:22] [INFO ] Invariant cache hit.
[2024-05-23 19:27:22] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-23 19:27:22] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:27:22] [INFO ] Invariant cache hit.
[2024-05-23 19:27:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:27:24] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1639 ms to find 0 implicit places.
[2024-05-23 19:27:24] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 19:27:24] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:27:24] [INFO ] Invariant cache hit.
[2024-05-23 19:27:24] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 19:27:45] [INFO ] Deduced a trap composed of 131 places in 99 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34857ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34867ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36588 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 19:27:59] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[181] Max Struct:[+inf]
[2024-05-23 19:27:59] [INFO ] Flatten gal took : 59 ms
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-23 19:27:59] [INFO ] Flatten gal took : 73 ms
[2024-05-23 19:27:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5663542168244425628.gal : 5 ms
[2024-05-23 19:27:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13099690165657529884.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5663542168244425628.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13099690165657529884.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/ReachabilityCardinality13099690165657529884.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1973
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1973 after 1.19798e+06
Interrupted probabilistic random walk after 451782 steps, run timeout after 3004 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 451782 steps, saw 277031 distinct states, run finished after 3004 ms. (steps per millisecond=150 ) properties seen :0
[2024-05-23 19:28:02] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:28:02] [INFO ] Invariant cache hit.
[2024-05-23 19:28:02] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 71 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40009 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 478267 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 1
Probabilistic random walk after 478267 steps, saw 293270 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
[2024-05-23 19:28:06] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:28:06] [INFO ] Invariant cache hit.
[2024-05-23 19:28:06] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :1.19798e+06 after 3.35877e+10
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 48 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 19:28:07] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:28:07] [INFO ] Invariant cache hit.
[2024-05-23 19:28:07] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-23 19:28:07] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:28:07] [INFO ] Invariant cache hit.
[2024-05-23 19:28:07] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:28:08] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1655 ms to find 0 implicit places.
[2024-05-23 19:28:08] [INFO ] Redundant transitions in 21 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 19:28:08] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 19:28:08] [INFO ] Invariant cache hit.
[2024-05-23 19:28:08] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 19:28:29] [INFO ] Deduced a trap composed of 131 places in 91 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.35877e+10 after 4.41559e+17
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34175ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34185ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35915 ms. Remains : 423/423 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 423 transition count 681
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 553 place count 413 transition count 681
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 413 transition count 608
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 699 place count 340 transition count 608
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 955 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 21 transition count 35
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 4 with 2 rules applied. Total rules applied 1403 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1405 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 19 transition count 31
Applied a total of 1408 rules in 27 ms. Remains 19 /423 variables (removed 404) and now considering 31/1224 (removed 1193) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 19:28:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 19:28:43] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:28:43] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 19:28:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:28:43] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:28:43] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:28:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 19:28:43] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:28:43] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:28:43] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:28:43] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:28:43] [INFO ] Flatten gal took : 2 ms
[2024-05-23 19:28:43] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:28:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9094300383602497892.gal : 0 ms
[2024-05-23 19:28:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2025615043995831111.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9094300383602497892.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2025615043995831111.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/ReachabilityCardinality2025615043995831111.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 35107
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35107 after 6.2298e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.2298e+06 after 1.79901e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.79901e+07 after 4.1465e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.1465e+07 after 8.8369e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.8369e+07 after 1.82131e+08
Detected timeout of ITS tools.
[2024-05-23 19:28:49] [INFO ] Flatten gal took : 27 ms
[2024-05-23 19:28:49] [INFO ] Applying decomposition
[2024-05-23 19:28:49] [INFO ] Flatten gal took : 28 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/graph5865191933136384607.txt' '-o' '/tmp/graph5865191933136384607.bin' '-w' '/tmp/graph5865191933136384607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5865191933136384607.bin' '-l' '-1' '-v' '-w' '/tmp/graph5865191933136384607.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:28:49] [INFO ] Decomposing Gal with order
[2024-05-23 19:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:28:49] [INFO ] Removed a total of 2101 redundant transitions.
[2024-05-23 19:28:49] [INFO ] Flatten gal took : 55 ms
[2024-05-23 19:28:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 859 labels/synchronizations in 21 ms.
[2024-05-23 19:28:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10370093149905086792.gal : 6 ms
[2024-05-23 19:28:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2536984399641874676.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10370093149905086792.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2536984399641874676.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/ReachabilityCardinality2536984399641874676.prop.
Detected timeout of ITS tools.
[2024-05-23 19:28:58] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:28:58] [INFO ] Applying decomposition
[2024-05-23 19:28:58] [INFO ] Flatten gal took : 1 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/graph5357163355180625158.txt' '-o' '/tmp/graph5357163355180625158.bin' '-w' '/tmp/graph5357163355180625158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5357163355180625158.bin' '-l' '-1' '-v' '-w' '/tmp/graph5357163355180625158.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:28:58] [INFO ] Decomposing Gal with order
[2024-05-23 19:28:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:28:58] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-23 19:28:58] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:28:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-23 19:28:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17493493464678424757.gal : 1 ms
[2024-05-23 19:28:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13465910447868044482.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17493493464678424757.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13465910447868044482.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/ReachabilityCardinality13465910447868044482.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30153 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:[181] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-06 in 253435 ms.
Starting property specific reduction for FunctionPointer-PT-c064-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:29:13] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:29:13] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:29:13] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:29:13] [INFO ] Invariant cache hit.
[2024-05-23 19:29:13] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:29:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:29:13] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 19:29:13] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:29:13] [INFO ] [Real]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:29:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:29:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:29:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:29:13] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 19:29:13] [INFO ] [Nat]Added 92 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:29:13] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 69 ms.
[2024-05-23 19:29:14] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 492 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Graph (complete) has 2241 edges and 460 vertex of which 457 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 451 transition count 1292
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 451 transition count 1292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 451 transition count 1286
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 445 transition count 1272
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 445 transition count 1272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 445 transition count 1268
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 46 place count 440 transition count 1258
Iterating global reduction 3 with 5 rules applied. Total rules applied 51 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 56 place count 435 transition count 1246
Iterating global reduction 3 with 5 rules applied. Total rules applied 61 place count 435 transition count 1246
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 66 place count 430 transition count 1234
Iterating global reduction 3 with 5 rules applied. Total rules applied 71 place count 430 transition count 1234
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 76 place count 425 transition count 1224
Iterating global reduction 3 with 5 rules applied. Total rules applied 81 place count 425 transition count 1224
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 422 transition count 1218
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 422 transition count 1218
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 419 transition count 1212
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 417 transition count 1208
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 417 transition count 1208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 415 transition count 1204
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 414 transition count 1202
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 414 transition count 1202
Applied a total of 103 rules in 132 ms. Remains 414 /460 variables (removed 46) and now considering 1202/1310 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 414/460 places, 1202/1310 transitions.
[2024-05-23 19:29:14] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2024-05-23 19:29:15] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2024-05-23 19:29:15] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2074 ms. (481 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1213 ms. (823 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1597] Max Struct:[+inf]
[2024-05-23 19:29:18] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:29:18] [INFO ] Invariant cache hit.
[2024-05-23 19:29:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:29:18] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-23 19:29:18] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:29:18] [INFO ] [Real]Added 74 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:29:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:29:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:29:18] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 19:29:18] [INFO ] [Nat]Added 74 Read/Feed constraints in 27 ms returned sat
[2024-05-23 19:29:19] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 3 ms to minimize.
[2024-05-23 19:29:19] [INFO ] Deduced a trap composed of 72 places in 216 ms of which 3 ms to minimize.
[2024-05-23 19:29:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 495 ms
[2024-05-23 19:29:19] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 63 ms.
[2024-05-23 19:29:19] [INFO ] Added : 6 causal constraints over 3 iterations in 253 ms. Result :sat
Minimization took 300 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1597] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1597] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 44 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 43 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-23 19:29:25] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:29:25] [INFO ] Invariant cache hit.
[2024-05-23 19:29:25] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-23 19:29:25] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:29:25] [INFO ] Invariant cache hit.
[2024-05-23 19:29:25] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:29:26] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2024-05-23 19:29:26] [INFO ] Redundant transitions in 15 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 19:29:27] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:29:27] [INFO ] Invariant cache hit.
[2024-05-23 19:29:27] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-23 19:29:45] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/418 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 33932ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 33943ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35607 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-23 19:30:00] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[1597] Max Struct:[+inf]
[2024-05-23 19:30:01] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:30:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1597] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2199 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1305 ms. (765 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1597] Max Struct:[+inf]
[2024-05-23 19:30:04] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:30:04] [INFO ] Invariant cache hit.
[2024-05-23 19:30:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:30:04] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-23 19:30:04] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:30:05] [INFO ] [Real]Added 74 Read/Feed constraints in 42 ms returned sat
[2024-05-23 19:30:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:30:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:30:05] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 19:30:05] [INFO ] [Nat]Added 74 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:30:05] [INFO ] Deduced a trap composed of 74 places in 203 ms of which 2 ms to minimize.
[2024-05-23 19:30:05] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 2 ms to minimize.
[2024-05-23 19:30:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2024-05-23 19:30:05] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 68 ms.
[2024-05-23 19:30:06] [INFO ] Added : 6 causal constraints over 3 iterations in 255 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1597] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1597] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 41 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 53 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-23 19:30:12] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:30:12] [INFO ] Invariant cache hit.
[2024-05-23 19:30:12] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-23 19:30:12] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:30:12] [INFO ] Invariant cache hit.
[2024-05-23 19:30:12] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:30:13] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
[2024-05-23 19:30:13] [INFO ] Redundant transitions in 15 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 19:30:13] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:30:13] [INFO ] Invariant cache hit.
[2024-05-23 19:30:13] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-23 19:30:35] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1092 variables, and 4 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/414 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/418 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 74/492 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 1200/1692 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1692 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 1/1 constraints]
After SMT, in 64623ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 64633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66333 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-23 19:31:18] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1597] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
[2024-05-23 19:31:18] [INFO ] Flatten gal took : 40 ms
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-05-23 19:31:18] [INFO ] Flatten gal took : 27 ms
[2024-05-23 19:31:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4975670778843101944.gal : 5 ms
[2024-05-23 19:31:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14813029097371074420.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/ReachabilityCardinality4975670778843101944.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14813029097371074420.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/ReachabilityCardinality14813029097371074420.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 346370 steps, run timeout after 3008 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346370 steps, saw 212398 distinct states, run finished after 3009 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-23 19:31:21] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:31:21] [INFO ] Invariant cache hit.
[2024-05-23 19:31:21] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1537ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Parikh walk visited 0 properties in 2755 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 43 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 414/414 places, 1202/1202 transitions.
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 474377 steps, run timeout after 3006 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 474377 steps, saw 290885 distinct states, run finished after 3006 ms. (steps per millisecond=157 ) properties seen :0
[2024-05-23 19:31:29] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:31:29] [INFO ] Invariant cache hit.
[2024-05-23 19:31:29] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1245ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3066 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 41 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 41 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-23 19:31:33] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:31:33] [INFO ] Invariant cache hit.
[2024-05-23 19:31:33] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-23 19:31:33] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:31:33] [INFO ] Invariant cache hit.
[2024-05-23 19:31:34] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:31:35] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
[2024-05-23 19:31:35] [INFO ] Redundant transitions in 16 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 19:31:35] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-23 19:31:35] [INFO ] Invariant cache hit.
[2024-05-23 19:31:35] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
[2024-05-23 19:31:55] [INFO ] Deduced a trap composed of 131 places in 97 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Detected timeout of ITS tools.
[2024-05-23 19:32:08] [INFO ] Flatten gal took : 43 ms
[2024-05-23 19:32:08] [INFO ] Applying decomposition
[2024-05-23 19:32:08] [INFO ] Flatten gal took : 31 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/graph16485987484320560596.txt' '-o' '/tmp/graph16485987484320560596.bin' '-w' '/tmp/graph16485987484320560596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16485987484320560596.bin' '-l' '-1' '-v' '-w' '/tmp/graph16485987484320560596.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:32:09] [INFO ] Decomposing Gal with order
[2024-05-23 19:32:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:32:09] [INFO ] Removed a total of 2051 redundant transitions.
[2024-05-23 19:32:09] [INFO ] Flatten gal took : 54 ms
[2024-05-23 19:32:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 889 labels/synchronizations in 43 ms.
[2024-05-23 19:32:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10664706814792713248.gal : 6 ms
[2024-05-23 19:32:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality620590525930697336.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/ReachabilityCardinality10664706814792713248.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality620590525930697336.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/ReachabilityCardinality620590525930697336.prop.
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/418 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 34200ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 34210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35943 ms. Remains : 414/414 places, 1202/1202 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 534 rules applied. Total rules applied 534 place count 414 transition count 668
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 544 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 544 place count 404 transition count 600
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 680 place count 336 transition count 600
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 208 transition count 472
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 144 transition count 344
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 144 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 144 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 144 transition count 342
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1067 place count 143 transition count 342
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 80 transition count 216
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 80 transition count 216
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1256 place count 17 transition count 90
Iterating global reduction 3 with 63 rules applied. Total rules applied 1319 place count 17 transition count 90
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1382 place count 17 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1382 place count 17 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1384 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 16 transition count 24
Applied a total of 1386 rules in 36 ms. Remains 16 /414 variables (removed 398) and now considering 24/1202 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 16 cols
[2024-05-23 19:32:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 19:32:09] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:32:09] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 19:32:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:32:09] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:32:09] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:32:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 19:32:09] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:32:09] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:32:09] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:32:09] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:32:09] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:32:09] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:32:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14106695280355684819.gal : 1 ms
[2024-05-23 19:32:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4103192447763344413.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/ReachabilityCardinality14106695280355684819.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4103192447763344413.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/ReachabilityCardinality4103192447763344413.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 287427
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :287427 after 4.65965e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.65965e+07 after 1.40496e+08
Invariant property MIN0 does not hold.
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,3.28112e+08,4.47893,98836,2,357,15,23468,6,0,88,16234,0
Total reachable state count : 328112067
Verifying 1 reachability properties.
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,183040,4.47966,98836,2,336,15,23468,7,0,91,16234,0
Over-approximation ignoring read arcs solved 0 properties in 4646 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:[1597] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-07 in 180869 ms.
Starting property specific reduction for FunctionPointer-PT-c064-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:32:14] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:32:14] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:32:14] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:32:14] [INFO ] Invariant cache hit.
[2024-05-23 19:32:14] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:32:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-23 19:32:14] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 19:32:14] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:32:14] [INFO ] [Real]Added 92 Read/Feed constraints in 32 ms returned sat
[2024-05-23 19:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:32:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:32:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:32:14] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 19:32:14] [INFO ] [Nat]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:32:14] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 82 ms.
[2024-05-23 19:32:14] [INFO ] Added : 4 causal constraints over 2 iterations in 221 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Graph (complete) has 2241 edges and 460 vertex of which 457 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 451 transition count 1292
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 451 transition count 1292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 451 transition count 1286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 446 transition count 1274
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 446 transition count 1274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 446 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 442 transition count 1262
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 438 transition count 1252
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 438 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 59 place count 434 transition count 1242
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 434 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 430 transition count 1234
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 430 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 427 transition count 1228
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 427 transition count 1228
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 424 transition count 1222
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 424 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 422 transition count 1218
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 422 transition count 1218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 420 transition count 1214
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 419 transition count 1212
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 419 transition count 1212
Applied a total of 93 rules in 172 ms. Remains 419 /460 variables (removed 41) and now considering 1212/1310 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 419/460 places, 1212/1310 transitions.
[2024-05-23 19:32:15] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-23 19:32:16] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-23 19:32:16] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2093 ms. (477 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1128 ms. (885 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[475] Max Struct:[+inf]
[2024-05-23 19:32:19] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:32:19] [INFO ] Invariant cache hit.
[2024-05-23 19:32:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:32:19] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 19:32:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:32:19] [INFO ] [Real]Added 75 Read/Feed constraints in 38 ms returned sat
[2024-05-23 19:32:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:32:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:32:19] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 19:32:19] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 19:32:20] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 3 ms to minimize.
[2024-05-23 19:32:20] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 2 ms to minimize.
[2024-05-23 19:32:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2024-05-23 19:32:20] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 73 ms.
[2024-05-23 19:32:20] [INFO ] Added : 14 causal constraints over 4 iterations in 307 ms. Result :sat
Minimization took 320 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[475] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[475] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 41 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 90 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 19:32:23] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:32:23] [INFO ] Invariant cache hit.
[2024-05-23 19:32:23] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-23 19:32:23] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:32:23] [INFO ] Invariant cache hit.
[2024-05-23 19:32:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:32:24] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2024-05-23 19:32:24] [INFO ] Redundant transitions in 19 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 19:32:24] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:32:24] [INFO ] Invariant cache hit.
[2024-05-23 19:32:24] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 19:32:44] [INFO ] Deduced a trap composed of 131 places in 98 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1104 variables, and 4 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/419 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1104 variables, 75/498 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1104 variables, 1210/1708 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 1708 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 1/1 constraints]
After SMT, in 65046ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 65058ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66736 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 19:33:29] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[475] Max Struct:[+inf]
[2024-05-23 19:33:30] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:33:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[475] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2099 ms. (476 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1210 ms. (825 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[517] Max Struct:[+inf]
[2024-05-23 19:33:33] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:33:33] [INFO ] Invariant cache hit.
[2024-05-23 19:33:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:33:33] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:33:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:33:33] [INFO ] [Real]Added 75 Read/Feed constraints in 38 ms returned sat
[2024-05-23 19:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:33:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:33:34] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:33:34] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 19:33:34] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 2 ms to minimize.
[2024-05-23 19:33:34] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 3 ms to minimize.
[2024-05-23 19:33:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 463 ms
[2024-05-23 19:33:34] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 64 ms.
[2024-05-23 19:33:34] [INFO ] Added : 14 causal constraints over 4 iterations in 286 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[517] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[517] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 41 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 19:33:37] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:33:37] [INFO ] Invariant cache hit.
[2024-05-23 19:33:38] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-23 19:33:38] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:33:38] [INFO ] Invariant cache hit.
[2024-05-23 19:33:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:33:39] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
[2024-05-23 19:33:39] [INFO ] Redundant transitions in 18 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 19:33:39] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:33:39] [INFO ] Invariant cache hit.
[2024-05-23 19:33:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 19:33:59] [INFO ] Deduced a trap composed of 131 places in 96 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 timeout
0.0)
(s181 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1104 variables, and 4 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/419 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1104 variables, 75/498 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1104 variables, 1210/1708 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 1708 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 1/1 constraints]
After SMT, in 64212ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 64223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65830 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 19:34:43] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[517] Max Struct:[+inf]
[2024-05-23 19:34:43] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:34:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[517] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1994 ms. (501 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1124 ms. (888 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[517] Max Struct:[+inf]
[2024-05-23 19:34:47] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:34:47] [INFO ] Invariant cache hit.
[2024-05-23 19:34:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:34:47] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 19:34:47] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:34:47] [INFO ] [Real]Added 75 Read/Feed constraints in 38 ms returned sat
[2024-05-23 19:34:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:34:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:34:47] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-23 19:34:47] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 19:34:47] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 3 ms to minimize.
[2024-05-23 19:34:48] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 3 ms to minimize.
[2024-05-23 19:34:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 472 ms
[2024-05-23 19:34:48] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 74 ms.
[2024-05-23 19:34:48] [INFO ] Added : 14 causal constraints over 4 iterations in 305 ms. Result :sat
Minimization took 334 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[517] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[517] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 52 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 61 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 19:34:51] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:34:51] [INFO ] Invariant cache hit.
[2024-05-23 19:34:51] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 19:34:51] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:34:51] [INFO ] Invariant cache hit.
[2024-05-23 19:34:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:34:53] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2024-05-23 19:34:53] [INFO ] Redundant transitions in 20 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 19:34:53] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:34:53] [INFO ] Invariant cache hit.
[2024-05-23 19:34:53] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 19:35:13] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 35004ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 35017ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36655 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 19:35:28] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[517] Max Struct:[+inf]
[2024-05-23 19:35:28] [INFO ] Flatten gal took : 28 ms
RANDOM walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
[2024-05-23 19:35:28] [INFO ] Flatten gal took : 25 ms
[2024-05-23 19:35:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3618895885496589713.gal : 4 ms
[2024-05-23 19:35:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3271982057161842808.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3618895885496589713.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3271982057161842808.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3271982057161842808.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 481870 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 1
Probabilistic random walk after 481870 steps, saw 295480 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-05-23 19:35:31] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:35:31] [INFO ] Invariant cache hit.
[2024-05-23 19:35:31] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 563ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1504 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 44 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 419/419 places, 1212/1212 transitions.
RANDOM walk for 40001 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 477105 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 477105 steps, saw 292558 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2024-05-23 19:35:36] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:35:36] [INFO ] Invariant cache hit.
[2024-05-23 19:35:36] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1459 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 19:35:38] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:35:38] [INFO ] Invariant cache hit.
[2024-05-23 19:35:39] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-23 19:35:39] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:35:39] [INFO ] Invariant cache hit.
[2024-05-23 19:35:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:35:40] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
[2024-05-23 19:35:40] [INFO ] Redundant transitions in 19 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 19:35:40] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 19:35:40] [INFO ] Invariant cache hit.
[2024-05-23 19:35:40] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 19:35:59] [INFO ] Deduced a trap composed of 131 places in 96 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34622ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34632ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36279 ms. Remains : 419/419 places, 1212/1212 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 419 transition count 673
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 551 place count 407 transition count 673
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 551 place count 407 transition count 604
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 689 place count 338 transition count 604
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 945 place count 210 transition count 476
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1009 place count 146 transition count 348
Iterating global reduction 2 with 64 rules applied. Total rules applied 1073 place count 146 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1074 place count 146 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1074 place count 146 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1076 place count 145 transition count 346
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1139 place count 82 transition count 220
Iterating global reduction 3 with 63 rules applied. Total rules applied 1202 place count 82 transition count 220
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1265 place count 19 transition count 94
Iterating global reduction 3 with 63 rules applied. Total rules applied 1328 place count 19 transition count 94
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1391 place count 19 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1391 place count 19 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1393 place count 18 transition count 30
Applied a total of 1393 rules in 22 ms. Remains 18 /419 variables (removed 401) and now considering 30/1212 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2024-05-23 19:36:15] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 19:36:15] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:36:15] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:36:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:36:15] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:36:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:36:15] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:36:15] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:36:15] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:36:15] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:36:15] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:36:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality606690604039219963.gal : 1 ms
[2024-05-23 19:36:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4434333707402403606.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality606690604039219963.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4434333707402403606.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality4434333707402403606.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 35107
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35107 after 6.2298e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.2298e+06 after 1.79901e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.79901e+07 after 4.1465e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.1465e+07 after 8.8369e+07
Detected timeout of ITS tools.
[2024-05-23 19:36:18] [INFO ] Flatten gal took : 24 ms
[2024-05-23 19:36:18] [INFO ] Applying decomposition
[2024-05-23 19:36:18] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14883175262863038402.txt' '-o' '/tmp/graph14883175262863038402.bin' '-w' '/tmp/graph14883175262863038402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14883175262863038402.bin' '-l' '-1' '-v' '-w' '/tmp/graph14883175262863038402.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:36:18] [INFO ] Decomposing Gal with order
[2024-05-23 19:36:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:36:18] [INFO ] Removed a total of 2073 redundant transitions.
[2024-05-23 19:36:18] [INFO ] Flatten gal took : 47 ms
[2024-05-23 19:36:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 854 labels/synchronizations in 19 ms.
[2024-05-23 19:36:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality472499620657032448.gal : 11 ms
[2024-05-23 19:36:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3132368038346082586.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality472499620657032448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3132368038346082586.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 ...306
Loading property file /tmp/ReachabilityCardinality3132368038346082586.prop.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.8369e+07 after 1.82131e+08
Detected timeout of ITS tools.
[2024-05-23 19:36:30] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:36:30] [INFO ] Applying decomposition
[2024-05-23 19:36:30] [INFO ] Flatten gal took : 1 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/graph1654508811960908003.txt' '-o' '/tmp/graph1654508811960908003.bin' '-w' '/tmp/graph1654508811960908003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1654508811960908003.bin' '-l' '-1' '-v' '-w' '/tmp/graph1654508811960908003.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:36:30] [INFO ] Decomposing Gal with order
[2024-05-23 19:36:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:36:30] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-23 19:36:30] [INFO ] Flatten gal took : 2 ms
[2024-05-23 19:36:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-23 19:36:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16895361611772011441.gal : 0 ms
[2024-05-23 19:36:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17714784851545062140.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16895361611772011441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17714784851545062140.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/ReachabilityCardinality17714784851545062140.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30148 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:[517] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-10 in 271241 ms.
Starting property specific reduction for FunctionPointer-PT-c064-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:36:45] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:36:45] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:36:45] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:36:45] [INFO ] Invariant cache hit.
[2024-05-23 19:36:45] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:36:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:36:45] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:36:45] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:36:45] [INFO ] [Real]Added 92 Read/Feed constraints in 24 ms returned sat
[2024-05-23 19:36:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:36:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:36:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:36:45] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:36:45] [INFO ] [Nat]Added 92 Read/Feed constraints in 28 ms returned sat
[2024-05-23 19:36:46] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 19:36:46] [INFO ] Added : 16 causal constraints over 5 iterations in 314 ms. Result :sat
Minimization took 495 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Graph (complete) has 2241 edges and 460 vertex of which 457 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 451 transition count 1292
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 451 transition count 1292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 451 transition count 1286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 446 transition count 1276
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 446 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 446 transition count 1272
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 442 transition count 1264
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 442 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 438 transition count 1254
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 438 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 59 place count 434 transition count 1244
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 434 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 430 transition count 1236
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 430 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 428 transition count 1232
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 428 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 426 transition count 1228
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 424 transition count 1224
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 422 transition count 1220
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 421 transition count 1218
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 421 transition count 1218
Applied a total of 89 rules in 123 ms. Remains 421 /460 variables (removed 39) and now considering 1218/1310 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 421/460 places, 1218/1310 transitions.
[2024-05-23 19:36:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 19:36:47] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-23 19:36:47] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2073 ms. (482 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1140 ms. (876 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[455] Max Struct:[+inf]
[2024-05-23 19:36:50] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:36:50] [INFO ] Invariant cache hit.
[2024-05-23 19:36:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:36:50] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-23 19:36:50] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:36:50] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-23 19:36:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:36:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:36:50] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:36:50] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 19:36:51] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 3 ms to minimize.
[2024-05-23 19:36:51] [INFO ] Deduced a trap composed of 109 places in 198 ms of which 3 ms to minimize.
[2024-05-23 19:36:51] [INFO ] Deduced a trap composed of 87 places in 196 ms of which 3 ms to minimize.
[2024-05-23 19:36:51] [INFO ] Deduced a trap composed of 78 places in 189 ms of which 3 ms to minimize.
[2024-05-23 19:36:52] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 3 ms to minimize.
[2024-05-23 19:36:52] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 3 ms to minimize.
[2024-05-23 19:36:52] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 3 ms to minimize.
[2024-05-23 19:36:52] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 3 ms to minimize.
[2024-05-23 19:36:52] [INFO ] Deduced a trap composed of 71 places in 193 ms of which 3 ms to minimize.
[2024-05-23 19:36:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1951 ms
[2024-05-23 19:36:52] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 57 ms.
[2024-05-23 19:36:53] [INFO ] Added : 10 causal constraints over 3 iterations in 236 ms. Result :sat
Minimization took 283 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[455] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[455] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 48 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 19:36:53] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:36:53] [INFO ] Invariant cache hit.
[2024-05-23 19:36:53] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 19:36:53] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:36:53] [INFO ] Invariant cache hit.
[2024-05-23 19:36:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:36:55] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
[2024-05-23 19:36:55] [INFO ] Redundant transitions in 21 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 19:36:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:36:55] [INFO ] Invariant cache hit.
[2024-05-23 19:36:55] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 19:37:16] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 35004ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 35018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36648 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 19:37:30] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[455] Max Struct:[+inf]
[2024-05-23 19:37:30] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:37:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[455] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2178 ms. (458 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1266 ms. (789 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[455] Max Struct:[+inf]
[2024-05-23 19:37:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:37:33] [INFO ] Invariant cache hit.
[2024-05-23 19:37:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:37:34] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-23 19:37:34] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:37:34] [INFO ] [Real]Added 75 Read/Feed constraints in 39 ms returned sat
[2024-05-23 19:37:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:37:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:37:34] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 19:37:34] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 19:37:34] [INFO ] Deduced a trap composed of 113 places in 197 ms of which 3 ms to minimize.
[2024-05-23 19:37:34] [INFO ] Deduced a trap composed of 109 places in 202 ms of which 3 ms to minimize.
[2024-05-23 19:37:35] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 3 ms to minimize.
[2024-05-23 19:37:35] [INFO ] Deduced a trap composed of 78 places in 201 ms of which 3 ms to minimize.
[2024-05-23 19:37:35] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 3 ms to minimize.
[2024-05-23 19:37:35] [INFO ] Deduced a trap composed of 73 places in 187 ms of which 3 ms to minimize.
[2024-05-23 19:37:36] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 3 ms to minimize.
[2024-05-23 19:37:36] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 2 ms to minimize.
[2024-05-23 19:37:36] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 3 ms to minimize.
[2024-05-23 19:37:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2019 ms
[2024-05-23 19:37:36] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 64 ms.
[2024-05-23 19:37:36] [INFO ] Added : 10 causal constraints over 3 iterations in 248 ms. Result :sat
Minimization took 306 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[455] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[455] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 58 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 19:37:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:37:37] [INFO ] Invariant cache hit.
[2024-05-23 19:37:37] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-23 19:37:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:37:37] [INFO ] Invariant cache hit.
[2024-05-23 19:37:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:37:38] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2024-05-23 19:37:38] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 19:37:38] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:37:38] [INFO ] Invariant cache hit.
[2024-05-23 19:37:38] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 19:37:59] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 4.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 timeout
0.0)
(s395 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34781ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36459 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 19:38:13] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[455] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2024-05-23 19:38:13] [INFO ] Flatten gal took : 42 ms
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-05-23 19:38:13] [INFO ] Flatten gal took : 26 ms
[2024-05-23 19:38:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12155177563328397638.gal : 4 ms
[2024-05-23 19:38:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1104168126270757147.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12155177563328397638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1104168126270757147.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/ReachabilityCardinality1104168126270757147.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 489628 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 489628 steps, saw 300236 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2024-05-23 19:38:16] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:38:16] [INFO ] Invariant cache hit.
[2024-05-23 19:38:16] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2385 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40005 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 459416 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 459416 steps, saw 281711 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2024-05-23 19:38:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:38:23] [INFO ] Invariant cache hit.
[2024-05-23 19:38:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 569ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2484 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 56 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 19:38:26] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:38:26] [INFO ] Invariant cache hit.
[2024-05-23 19:38:26] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-23 19:38:26] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:38:26] [INFO ] Invariant cache hit.
[2024-05-23 19:38:26] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:38:27] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2024-05-23 19:38:27] [INFO ] Redundant transitions in 18 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 19:38:27] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 19:38:27] [INFO ] Invariant cache hit.
[2024-05-23 19:38:27] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
[2024-05-23 19:38:50] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 35018ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 35030ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36666 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
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 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 47 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 19:39:02] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 19:39:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 19:39:02] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 19:39:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:39:02] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:39:02] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:39:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 19:39:02] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:39:02] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:39:02] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:39:02] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:39:02] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:39:02] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:39:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9720471801175626852.gal : 1 ms
[2024-05-23 19:39:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10675592500337383283.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9720471801175626852.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10675592500337383283.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/ReachabilityCardinality10675592500337383283.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 35107
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35107 after 6.2298e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.2298e+06 after 1.79901e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.79901e+07 after 4.1465e+07
Detected timeout of ITS tools.
[2024-05-23 19:39:04] [INFO ] Flatten gal took : 24 ms
[2024-05-23 19:39:04] [INFO ] Applying decomposition
[2024-05-23 19:39:04] [INFO ] Flatten gal took : 24 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/graph8711123228839923927.txt' '-o' '/tmp/graph8711123228839923927.bin' '-w' '/tmp/graph8711123228839923927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8711123228839923927.bin' '-l' '-1' '-v' '-w' '/tmp/graph8711123228839923927.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:39:04] [INFO ] Decomposing Gal with order
[2024-05-23 19:39:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:39:04] [INFO ] Removed a total of 2082 redundant transitions.
[2024-05-23 19:39:04] [INFO ] Flatten gal took : 44 ms
[2024-05-23 19:39:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 850 labels/synchronizations in 19 ms.
[2024-05-23 19:39:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17142975644337651271.gal : 5 ms
[2024-05-23 19:39:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10662187569529706581.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17142975644337651271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10662187569529706581.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
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.1465e+07 after 8.8369e+07
Loading property file /tmp/ReachabilityCardinality10662187569529706581.prop.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.8369e+07 after 1.82131e+08
Detected timeout of ITS tools.
[2024-05-23 19:39:17] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:39:17] [INFO ] Applying decomposition
[2024-05-23 19:39:17] [INFO ] Flatten gal took : 2 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/graph2122673460383551090.txt' '-o' '/tmp/graph2122673460383551090.bin' '-w' '/tmp/graph2122673460383551090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2122673460383551090.bin' '-l' '-1' '-v' '-w' '/tmp/graph2122673460383551090.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:39:17] [INFO ] Decomposing Gal with order
[2024-05-23 19:39:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:39:17] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-23 19:39:17] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:39:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-23 19:39:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6759306239816323095.gal : 1 ms
[2024-05-23 19:39:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16047721785298770963.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/ReachabilityCardinality6759306239816323095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16047721785298770963.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/ReachabilityCardinality16047721785298770963.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 37824
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30176 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:[455] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-11 in 167615 ms.
Starting property specific reduction for FunctionPointer-PT-c064-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:39:32] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:39:32] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:39:32] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:39:32] [INFO ] Invariant cache hit.
[2024-05-23 19:39:33] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:39:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:39:33] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 19:39:33] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:39:33] [INFO ] [Real]Added 92 Read/Feed constraints in 34 ms returned sat
[2024-05-23 19:39:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:39:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:39:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:39:33] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 19:39:33] [INFO ] [Nat]Added 92 Read/Feed constraints in 30 ms returned sat
[2024-05-23 19:39:33] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 65 ms.
[2024-05-23 19:39:33] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 467 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[63] Max Struct:[+inf]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 453 transition count 1296
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 453 transition count 1296
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 453 transition count 1290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 447 transition count 1276
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 447 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 447 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 442 transition count 1262
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 442 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 437 transition count 1250
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 432 transition count 1238
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 432 transition count 1238
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 427 transition count 1228
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 427 transition count 1228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 424 transition count 1222
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 424 transition count 1222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 421 transition count 1216
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 421 transition count 1216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 419 transition count 1212
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 417 transition count 1208
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 416 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 416 transition count 1206
Applied a total of 98 rules in 131 ms. Remains 416 /460 variables (removed 44) and now considering 1206/1310 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 416/460 places, 1206/1310 transitions.
[2024-05-23 19:39:34] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[63] Max Struct:[+inf]
[2024-05-23 19:39:34] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2024-05-23 19:39:34] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[63] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2118 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1334 ms. (749 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[63] Max Struct:[+inf]
[2024-05-23 19:39:38] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:39:38] [INFO ] Invariant cache hit.
[2024-05-23 19:39:38] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:39:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:39:38] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-23 19:39:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:39:38] [INFO ] [Real]Added 75 Read/Feed constraints in 49 ms returned sat
[2024-05-23 19:39:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:39:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:39:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:39:38] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 19:39:38] [INFO ] [Nat]Added 75 Read/Feed constraints in 66 ms returned sat
[2024-05-23 19:39:38] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 66 ms.
[2024-05-23 19:39:39] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 3 ms to minimize.
[2024-05-23 19:39:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2024-05-23 19:39:39] [INFO ] Added : 6 causal constraints over 2 iterations in 459 ms. Result :sat
Minimization took 456 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[63] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 19:39:40] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:39:40] [INFO ] Invariant cache hit.
[2024-05-23 19:39:40] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 19:39:40] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:39:40] [INFO ] Invariant cache hit.
[2024-05-23 19:39:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:39:41] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2024-05-23 19:39:41] [INFO ] Redundant transitions in 19 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 19:39:41] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:39:41] [INFO ] Invariant cache hit.
[2024-05-23 19:39:41] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34768ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34779ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36420 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-23 19:40:16] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[64] Max Struct:[+inf]
[2024-05-23 19:40:16] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:40:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[64] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2110 ms. (473 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1276 ms. (783 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[64] Max Struct:[+inf]
[2024-05-23 19:40:20] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:40:20] [INFO ] Invariant cache hit.
[2024-05-23 19:40:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:40:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:40:20] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:40:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:40:20] [INFO ] [Real]Added 75 Read/Feed constraints in 49 ms returned sat
[2024-05-23 19:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:40:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:40:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:40:20] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 19:40:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 64 ms returned sat
[2024-05-23 19:40:20] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 3 ms to minimize.
[2024-05-23 19:40:21] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 2 ms to minimize.
[2024-05-23 19:40:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2024-05-23 19:40:21] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 66 ms.
[2024-05-23 19:40:21] [INFO ] Added : 4 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 465 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[64] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 52 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 51 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 19:40:22] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:40:22] [INFO ] Invariant cache hit.
[2024-05-23 19:40:22] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 19:40:22] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:40:22] [INFO ] Invariant cache hit.
[2024-05-23 19:40:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:40:23] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
[2024-05-23 19:40:23] [INFO ] Redundant transitions in 22 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 19:40:23] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:40:23] [INFO ] Invariant cache hit.
[2024-05-23 19:40:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34566ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34579ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36282 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-23 19:40:58] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[64] Max Struct:[+inf]
RANDOM walk for 40005 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-23 19:40:58] [INFO ] Flatten gal took : 30 ms
[2024-05-23 19:40:58] [INFO ] Flatten gal took : 27 ms
[2024-05-23 19:40:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3766134524671228589.gal : 4 ms
[2024-05-23 19:40:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10053823772852701645.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3766134524671228589.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10053823772852701645.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/ReachabilityCardinality10053823772852701645.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 485852 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 485852 steps, saw 298529 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2024-05-23 19:41:01] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:41:01] [INFO ] Invariant cache hit.
[2024-05-23 19:41:01] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1014 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1015 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/1014 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:41:02] [INFO ] Deduced a trap composed of 135 places in 171 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 890ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 47 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 416/416 places, 1206/1206 transitions.
RANDOM walk for 40012 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 458029 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 458029 steps, saw 282554 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2024-05-23 19:41:05] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:41:05] [INFO ] Invariant cache hit.
[2024-05-23 19:41:05] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1014 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1015 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/1014 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:41:06] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 899ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 51 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 52 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 19:41:06] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:41:06] [INFO ] Invariant cache hit.
[2024-05-23 19:41:06] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-23 19:41:06] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:41:06] [INFO ] Invariant cache hit.
[2024-05-23 19:41:07] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:41:08] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
[2024-05-23 19:41:08] [INFO ] Redundant transitions in 19 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 19:41:08] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 19:41:08] [INFO ] Invariant cache hit.
[2024-05-23 19:41:08] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34448ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34459ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36078 ms. Remains : 416/416 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 670
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 548 place count 405 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 404 transition count 669
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 549 place count 404 transition count 601
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 685 place count 336 transition count 601
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 939 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1003 place count 145 transition count 346
Iterating global reduction 3 with 64 rules applied. Total rules applied 1067 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1068 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1070 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1133 place count 81 transition count 218
Iterating global reduction 4 with 63 rules applied. Total rules applied 1196 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1259 place count 18 transition count 92
Iterating global reduction 4 with 63 rules applied. Total rules applied 1322 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1385 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1387 place count 17 transition count 28
Applied a total of 1387 rules in 24 ms. Remains 17 /416 variables (removed 399) and now considering 28/1206 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 17 cols
[2024-05-23 19:41:42] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 19:41:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 19:41:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:41:42] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:41:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 19:41:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:41:42] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:41:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:41:42] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:41:42] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:41:42] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:41:42] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:41:42] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:41:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6364427830839617681.gal : 1 ms
[2024-05-23 19:41:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2543997920808586445.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6364427830839617681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2543997920808586445.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/ReachabilityCardinality2543997920808586445.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 287427
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :287427 after 4.65965e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.65965e+07 after 1.40496e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.40496e+08 after 3.28112e+08
Detected timeout of ITS tools.
[2024-05-23 19:41:48] [INFO ] Flatten gal took : 24 ms
[2024-05-23 19:41:48] [INFO ] Applying decomposition
[2024-05-23 19:41:48] [INFO ] Flatten gal took : 24 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/graph17880774213742246099.txt' '-o' '/tmp/graph17880774213742246099.bin' '-w' '/tmp/graph17880774213742246099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17880774213742246099.bin' '-l' '-1' '-v' '-w' '/tmp/graph17880774213742246099.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:41:48] [INFO ] Decomposing Gal with order
[2024-05-23 19:41:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:41:48] [INFO ] Removed a total of 2061 redundant transitions.
[2024-05-23 19:41:48] [INFO ] Flatten gal took : 60 ms
[2024-05-23 19:41:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 861 labels/synchronizations in 51 ms.
[2024-05-23 19:41:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1272509139142087899.gal : 4 ms
[2024-05-23 19:41:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2073842524977001708.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1272509139142087899.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2073842524977001708.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/ReachabilityCardinality2073842524977001708.prop.
Detected timeout of ITS tools.
[2024-05-23 19:41:57] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:41:57] [INFO ] Applying decomposition
[2024-05-23 19:41:57] [INFO ] Flatten gal took : 0 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/graph7830932492779383197.txt' '-o' '/tmp/graph7830932492779383197.bin' '-w' '/tmp/graph7830932492779383197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7830932492779383197.bin' '-l' '-1' '-v' '-w' '/tmp/graph7830932492779383197.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:41:57] [INFO ] Decomposing Gal with order
[2024-05-23 19:41:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:41:57] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-23 19:41:57] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:41:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-23 19:41:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8280911203979620138.gal : 0 ms
[2024-05-23 19:41:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3761611322057373630.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/ReachabilityCardinality8280911203979620138.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3761611322057373630.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/ReachabilityCardinality3761611322057373630.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 62207
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :62207 after 7.71533e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30172 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:[64] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-12 in 159934 ms.
Starting property specific reduction for FunctionPointer-PT-c064-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:42:12] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:42:12] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 19:42:12] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:42:12] [INFO ] Invariant cache hit.
[2024-05-23 19:42:13] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:42:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:42:13] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 19:42:13] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:42:13] [INFO ] [Real]Added 92 Read/Feed constraints in 33 ms returned sat
[2024-05-23 19:42:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:42:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:42:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:42:13] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 19:42:13] [INFO ] [Nat]Added 92 Read/Feed constraints in 24 ms returned sat
[2024-05-23 19:42:13] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 72 ms.
[2024-05-23 19:42:13] [INFO ] Added : 1 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 451 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Graph (complete) has 2241 edges and 460 vertex of which 457 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 451 transition count 1292
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 451 transition count 1292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 451 transition count 1288
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 445 transition count 1274
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 445 transition count 1274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 445 transition count 1270
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 44 place count 440 transition count 1260
Iterating global reduction 3 with 5 rules applied. Total rules applied 49 place count 440 transition count 1260
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 435 transition count 1248
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 435 transition count 1248
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 64 place count 430 transition count 1236
Iterating global reduction 3 with 5 rules applied. Total rules applied 69 place count 430 transition count 1236
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 73 place count 426 transition count 1228
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 426 transition count 1228
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 423 transition count 1222
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 423 transition count 1222
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 420 transition count 1216
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 420 transition count 1216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 418 transition count 1212
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 418 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 416 transition count 1208
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 415 transition count 1206
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 415 transition count 1206
Applied a total of 99 rules in 135 ms. Remains 415 /460 variables (removed 45) and now considering 1206/1310 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 415/460 places, 1206/1310 transitions.
[2024-05-23 19:42:14] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 19:42:14] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2024-05-23 19:42:14] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2078 ms. (481 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1199 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[632] Max Struct:[+inf]
[2024-05-23 19:42:18] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:42:18] [INFO ] Invariant cache hit.
[2024-05-23 19:42:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:42:18] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 19:42:18] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:42:18] [INFO ] [Real]Added 74 Read/Feed constraints in 26 ms returned sat
[2024-05-23 19:42:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:42:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:42:18] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:42:18] [INFO ] [Nat]Added 74 Read/Feed constraints in 22 ms returned sat
[2024-05-23 19:42:18] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 3 ms to minimize.
[2024-05-23 19:42:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-05-23 19:42:18] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 82 ms.
[2024-05-23 19:42:19] [INFO ] Deduced a trap composed of 209 places in 192 ms of which 3 ms to minimize.
[2024-05-23 19:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2024-05-23 19:42:19] [INFO ] Added : 7 causal constraints over 4 iterations in 591 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[632] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[632] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 59 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 19:42:22] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:42:22] [INFO ] Invariant cache hit.
[2024-05-23 19:42:22] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-23 19:42:22] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:42:22] [INFO ] Invariant cache hit.
[2024-05-23 19:42:23] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:42:24] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1443 ms to find 0 implicit places.
[2024-05-23 19:42:24] [INFO ] Redundant transitions in 19 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 19:42:24] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:42:24] [INFO ] Invariant cache hit.
[2024-05-23 19:42:24] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-23 19:42:44] [INFO ] Deduced a trap composed of 131 places in 98 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34435ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34446ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35974 ms. Remains : 415/415 places, 1206/1206 transitions.
[2024-05-23 19:42:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[632] Max Struct:[+inf]
[2024-05-23 19:42:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:42:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[632] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2077 ms. (481 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1171 ms. (853 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[632] Max Struct:[+inf]
[2024-05-23 19:43:02] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:43:02] [INFO ] Invariant cache hit.
[2024-05-23 19:43:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:43:02] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 19:43:02] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:43:02] [INFO ] [Real]Added 74 Read/Feed constraints in 23 ms returned sat
[2024-05-23 19:43:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:43:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:43:02] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-23 19:43:02] [INFO ] [Nat]Added 74 Read/Feed constraints in 21 ms returned sat
[2024-05-23 19:43:02] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 3 ms to minimize.
[2024-05-23 19:43:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-23 19:43:02] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 66 ms.
[2024-05-23 19:43:03] [INFO ] Deduced a trap composed of 209 places in 174 ms of which 2 ms to minimize.
[2024-05-23 19:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-05-23 19:43:03] [INFO ] Added : 7 causal constraints over 4 iterations in 535 ms. Result :sat
Minimization took 292 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[632] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[632] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 19:43:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:43:06] [INFO ] Invariant cache hit.
[2024-05-23 19:43:06] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-23 19:43:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:43:06] [INFO ] Invariant cache hit.
[2024-05-23 19:43:07] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:43:07] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2024-05-23 19:43:07] [INFO ] Redundant transitions in 17 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 19:43:07] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:43:07] [INFO ] Invariant cache hit.
[2024-05-23 19:43:07] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-23 19:43:28] [INFO ] Deduced a trap composed of 131 places in 95 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34476ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34488ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35937 ms. Remains : 415/415 places, 1206/1206 transitions.
[2024-05-23 19:43:42] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[632] Max Struct:[+inf]
[2024-05-23 19:43:42] [INFO ] Flatten gal took : 27 ms
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-05-23 19:43:42] [INFO ] Flatten gal took : 27 ms
[2024-05-23 19:43:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5960798902780226200.gal : 4 ms
[2024-05-23 19:43:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16099658888663331131.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5960798902780226200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16099658888663331131.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/ReachabilityCardinality16099658888663331131.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 487120 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 487120 steps, saw 298697 distinct states, run finished after 3003 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-23 19:43:45] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:43:45] [INFO ] Invariant cache hit.
[2024-05-23 19:43:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 748ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1256 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 53 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 415/415 places, 1206/1206 transitions.
RANDOM walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 445756 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 445756 steps, saw 273335 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-05-23 19:43:51] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:43:51] [INFO ] Invariant cache hit.
[2024-05-23 19:43:51] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 690ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1265 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 19:43:53] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:43:53] [INFO ] Invariant cache hit.
[2024-05-23 19:43:53] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-23 19:43:53] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:43:53] [INFO ] Invariant cache hit.
[2024-05-23 19:43:53] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 19:43:54] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
[2024-05-23 19:43:54] [INFO ] Redundant transitions in 19 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 19:43:54] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-23 19:43:54] [INFO ] Invariant cache hit.
[2024-05-23 19:43:54] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-23 19:44:15] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34954ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34965ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36547 ms. Remains : 415/415 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 938 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1002 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1066 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1067 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1069 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1132 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1195 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1258 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1321 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1384 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1384 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 17 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 17 transition count 25
Applied a total of 1389 rules in 23 ms. Remains 17 /415 variables (removed 398) and now considering 25/1206 (removed 1181) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2024-05-23 19:44:29] [INFO ] Computed 3 invariants in 5 ms
[2024-05-23 19:44:29] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:44:29] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 19:44:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:44:29] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:44:29] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:44:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:44:29] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:44:29] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:44:29] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:44:29] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:44:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:44:29] [INFO ] Flatten gal took : 0 ms
[2024-05-23 19:44:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16336417207418416926.gal : 1 ms
[2024-05-23 19:44:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality792083963725055113.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16336417207418416926.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality792083963725055113.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/ReachabilityCardinality792083963725055113.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 287427
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :287427 after 4.65965e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.65965e+07 after 1.40496e+08
Detected timeout of ITS tools.
[2024-05-23 19:44:33] [INFO ] Flatten gal took : 26 ms
[2024-05-23 19:44:33] [INFO ] Applying decomposition
[2024-05-23 19:44:33] [INFO ] Flatten gal took : 33 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/graph7117030955639641724.txt' '-o' '/tmp/graph7117030955639641724.bin' '-w' '/tmp/graph7117030955639641724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7117030955639641724.bin' '-l' '-1' '-v' '-w' '/tmp/graph7117030955639641724.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:44:33] [INFO ] Decomposing Gal with order
[2024-05-23 19:44:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:44:33] [INFO ] Removed a total of 2063 redundant transitions.
[2024-05-23 19:44:33] [INFO ] Flatten gal took : 43 ms
[2024-05-23 19:44:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 848 labels/synchronizations in 22 ms.
[2024-05-23 19:44:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17687332810313991889.gal : 5 ms
[2024-05-23 19:44:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10258580450335881629.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17687332810313991889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10258580450335881629.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/ReachabilityCardinality10258580450335881629.prop.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.40496e+08 after 3.28112e+08
Detected timeout of ITS tools.
[2024-05-23 19:44:44] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:44:44] [INFO ] Applying decomposition
[2024-05-23 19:44:44] [INFO ] Flatten gal took : 1 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/graph18147261126334345181.txt' '-o' '/tmp/graph18147261126334345181.bin' '-w' '/tmp/graph18147261126334345181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18147261126334345181.bin' '-l' '-1' '-v' '-w' '/tmp/graph18147261126334345181.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:44:44] [INFO ] Decomposing Gal with order
[2024-05-23 19:44:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:44:44] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-23 19:44:44] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:44:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-23 19:44:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2866188049597430740.gal : 1 ms
[2024-05-23 19:44:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5645290667039175452.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2866188049597430740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5645290667039175452.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/ReachabilityCardinality5645290667039175452.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 18914
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :18914 after 191618
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :191618 after 1.00583e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.00583e+09 after 1.02878e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.02878e+11 after 1.73583e+12
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30163 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:[632] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-13 in 166926 ms.
Starting property specific reduction for FunctionPointer-PT-c064-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:44:59] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
// Phase 1: matrix 755 rows 460 cols
[2024-05-23 19:44:59] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 19:44:59] [INFO ] Flow matrix only has 755 transitions (discarded 555 similar events)
[2024-05-23 19:44:59] [INFO ] Invariant cache hit.
[2024-05-23 19:44:59] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 19:44:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:45:00] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 19:45:00] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-23 19:45:00] [INFO ] [Real]Added 92 Read/Feed constraints in 23 ms returned sat
[2024-05-23 19:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:45:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 19:45:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 19:45:00] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 19:45:00] [INFO ] [Nat]Added 92 Read/Feed constraints in 20 ms returned sat
[2024-05-23 19:45:00] [INFO ] Computed and/alt/rep : 108/210/95 causal constraints (skipped 658 transitions) in 74 ms.
[2024-05-23 19:45:00] [INFO ] Added : 13 causal constraints over 3 iterations in 252 ms. Result :sat
Minimization took 479 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1310/1310 transitions.
Graph (complete) has 2241 edges and 460 vertex of which 457 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 451 transition count 1292
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 451 transition count 1292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 451 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 447 transition count 1278
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 447 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 443 transition count 1270
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 443 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 439 transition count 1260
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 439 transition count 1260
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 435 transition count 1252
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 435 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 431 transition count 1244
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 431 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 429 transition count 1240
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 429 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 427 transition count 1236
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 427 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 426 transition count 1234
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 426 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 425 transition count 1232
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 425 transition count 1232
Applied a total of 75 rules in 131 ms. Remains 425 /460 variables (removed 35) and now considering 1232/1310 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 425/460 places, 1232/1310 transitions.
[2024-05-23 19:45:01] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 19:45:01] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2024-05-23 19:45:01] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2401 ms. (416 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1330 ms. (751 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[123] Max Struct:[+inf]
[2024-05-23 19:45:05] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:45:05] [INFO ] Invariant cache hit.
[2024-05-23 19:45:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:45:05] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 19:45:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:45:05] [INFO ] [Real]Added 75 Read/Feed constraints in 37 ms returned sat
[2024-05-23 19:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:45:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 19:45:05] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 19:45:05] [INFO ] [Nat]Added 75 Read/Feed constraints in 43 ms returned sat
[2024-05-23 19:45:06] [INFO ] Deduced a trap composed of 113 places in 200 ms of which 3 ms to minimize.
[2024-05-23 19:45:06] [INFO ] Deduced a trap composed of 97 places in 203 ms of which 3 ms to minimize.
[2024-05-23 19:45:06] [INFO ] Deduced a trap composed of 81 places in 195 ms of which 2 ms to minimize.
[2024-05-23 19:45:06] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 3 ms to minimize.
[2024-05-23 19:45:07] [INFO ] Deduced a trap composed of 73 places in 188 ms of which 3 ms to minimize.
[2024-05-23 19:45:07] [INFO ] Deduced a trap composed of 71 places in 208 ms of which 3 ms to minimize.
[2024-05-23 19:45:07] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 3 ms to minimize.
[2024-05-23 19:45:07] [INFO ] Deduced a trap composed of 77 places in 184 ms of which 2 ms to minimize.
[2024-05-23 19:45:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1753 ms
[2024-05-23 19:45:07] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 71 ms.
[2024-05-23 19:45:08] [INFO ] Added : 29 causal constraints over 7 iterations in 372 ms. Result :sat
Minimization took 296 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[123] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[123] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 47 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 19:45:09] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:45:09] [INFO ] Invariant cache hit.
[2024-05-23 19:45:10] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-23 19:45:10] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:45:10] [INFO ] Invariant cache hit.
[2024-05-23 19:45:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:45:11] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
[2024-05-23 19:45:11] [INFO ] Redundant transitions in 20 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 19:45:11] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:45:11] [INFO ] Invariant cache hit.
[2024-05-23 19:45:11] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 19:45:32] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/429 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34411ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36066 ms. Remains : 425/425 places, 1232/1232 transitions.
[2024-05-23 19:45:45] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[123] Max Struct:[+inf]
[2024-05-23 19:45:46] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:45:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[123] Max Struct:[+inf]
RANDOM walk for 1000006 steps (2 resets) in 2118 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1434 ms. (696 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[123] Max Struct:[+inf]
[2024-05-23 19:45:49] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:45:49] [INFO ] Invariant cache hit.
[2024-05-23 19:45:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:45:49] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 19:45:49] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:45:49] [INFO ] [Real]Added 75 Read/Feed constraints in 40 ms returned sat
[2024-05-23 19:45:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:45:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 19:45:50] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 19:45:50] [INFO ] [Nat]Added 75 Read/Feed constraints in 39 ms returned sat
[2024-05-23 19:45:50] [INFO ] Deduced a trap composed of 113 places in 206 ms of which 2 ms to minimize.
[2024-05-23 19:45:50] [INFO ] Deduced a trap composed of 97 places in 192 ms of which 2 ms to minimize.
[2024-05-23 19:45:50] [INFO ] Deduced a trap composed of 81 places in 198 ms of which 3 ms to minimize.
[2024-05-23 19:45:51] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 3 ms to minimize.
[2024-05-23 19:45:51] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 3 ms to minimize.
[2024-05-23 19:45:51] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 3 ms to minimize.
[2024-05-23 19:45:51] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 3 ms to minimize.
[2024-05-23 19:45:51] [INFO ] Deduced a trap composed of 77 places in 199 ms of which 3 ms to minimize.
[2024-05-23 19:45:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1792 ms
[2024-05-23 19:45:52] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 96 ms.
[2024-05-23 19:45:52] [INFO ] Added : 29 causal constraints over 7 iterations in 414 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[123] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[123] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 56 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 56 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 19:45:54] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:45:54] [INFO ] Invariant cache hit.
[2024-05-23 19:45:54] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-23 19:45:54] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:45:54] [INFO ] Invariant cache hit.
[2024-05-23 19:45:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:45:55] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2024-05-23 19:45:55] [INFO ] Redundant transitions in 23 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 19:45:55] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:45:55] [INFO ] Invariant cache hit.
[2024-05-23 19:45:55] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 19:46:16] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/429 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34415ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34429ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36050 ms. Remains : 425/425 places, 1232/1232 transitions.
[2024-05-23 19:46:30] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[123] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
[2024-05-23 19:46:30] [INFO ] Flatten gal took : 26 ms
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-05-23 19:46:30] [INFO ] Flatten gal took : 26 ms
[2024-05-23 19:46:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1069835590602156563.gal : 4 ms
[2024-05-23 19:46:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9361415606328589714.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1069835590602156563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9361415606328589714.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/ReachabilityCardinality9361415606328589714.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1975
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1975 after 1.20219e+06
Interrupted probabilistic random walk after 486622 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 486622 steps, saw 298394 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-23 19:46:33] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:46:33] [INFO ] Invariant cache hit.
[2024-05-23 19:46:33] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 739ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 804 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 425/425 places, 1232/1232 transitions.
RANDOM walk for 40010 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.20219e+06 after 3.3929e+10
Interrupted probabilistic random walk after 482986 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 1
Probabilistic random walk after 482986 steps, saw 296164 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-05-23 19:46:38] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:46:38] [INFO ] Invariant cache hit.
[2024-05-23 19:46:38] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 708ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 799 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 19:46:39] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:46:39] [INFO ] Invariant cache hit.
[2024-05-23 19:46:40] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-23 19:46:40] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:46:40] [INFO ] Invariant cache hit.
[2024-05-23 19:46:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 19:46:41] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
[2024-05-23 19:46:41] [INFO ] Redundant transitions in 21 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 19:46:41] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2024-05-23 19:46:41] [INFO ] Invariant cache hit.
[2024-05-23 19:46:41] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 19:47:01] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.3929e+10 after 4.52909e+17
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/429 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34055ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34065ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35674 ms. Remains : 425/425 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 425 transition count 686
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 555 place count 416 transition count 686
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 555 place count 416 transition count 613
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 701 place count 343 transition count 613
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 961 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 149 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 149 transition count 353
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 86 transition count 227
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 86 transition count 227
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 23 transition count 101
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 23 transition count 101
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 23 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 23 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1408 place count 22 transition count 37
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 4 with 2 rules applied. Total rules applied 1410 place count 21 transition count 36
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 4 with 2 rules applied. Total rules applied 1412 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1415 place count 20 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1416 place count 19 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 1417 place count 19 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1419 place count 19 transition count 31
Applied a total of 1419 rules in 35 ms. Remains 19 /425 variables (removed 406) and now considering 31/1232 (removed 1201) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 19:47:15] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 19:47:15] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned sat
[2024-05-23 19:47:15] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 19:47:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:47:15] [INFO ] After 62ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:47:15] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:47:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 19:47:15] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:47:15] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:47:15] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:47:15] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:47:15] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:47:15] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:47:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10084818489595926981.gal : 1 ms
[2024-05-23 19:47:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14203633066717465338.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10084818489595926981.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14203633066717465338.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/ReachabilityCardinality14203633066717465338.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 326755
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :326755 after 2.38474e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.38474e+07 after 7.07972e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.07972e+07 after 1.64605e+08
Detected timeout of ITS tools.
[2024-05-23 19:47:20] [INFO ] Flatten gal took : 43 ms
[2024-05-23 19:47:20] [INFO ] Applying decomposition
[2024-05-23 19:47:20] [INFO ] Flatten gal took : 27 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/graph5628530382228795728.txt' '-o' '/tmp/graph5628530382228795728.bin' '-w' '/tmp/graph5628530382228795728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5628530382228795728.bin' '-l' '-1' '-v' '-w' '/tmp/graph5628530382228795728.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:47:20] [INFO ] Decomposing Gal with order
[2024-05-23 19:47:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:47:20] [INFO ] Removed a total of 2116 redundant transitions.
[2024-05-23 19:47:20] [INFO ] Flatten gal took : 44 ms
[2024-05-23 19:47:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 960 labels/synchronizations in 33 ms.
[2024-05-23 19:47:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9758245145989298563.gal : 5 ms
[2024-05-23 19:47:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13376512052136095481.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9758245145989298563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13376512052136095481.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/ReachabilityCardinality13376512052136095481.prop.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.64605e+08 after 3.5213e+08
Detected timeout of ITS tools.
[2024-05-23 19:47:30] [INFO ] Flatten gal took : 1 ms
[2024-05-23 19:47:30] [INFO ] Applying decomposition
[2024-05-23 19:47:30] [INFO ] Flatten gal took : 1 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/graph3637292835529262707.txt' '-o' '/tmp/graph3637292835529262707.bin' '-w' '/tmp/graph3637292835529262707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3637292835529262707.bin' '-l' '-1' '-v' '-w' '/tmp/graph3637292835529262707.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:47:30] [INFO ] Decomposing Gal with order
[2024-05-23 19:47:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:47:30] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-23 19:47:30] [INFO ] Flatten gal took : 2 ms
[2024-05-23 19:47:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-23 19:47:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4230570000646583674.gal : 1 ms
[2024-05-23 19:47:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16495353350520074828.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4230570000646583674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16495353350520074828.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/ReachabilityCardinality16495353350520074828.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30631 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:[123] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-14 in 166209 ms.
[2024-05-23 19:47:46] [INFO ] Flatten gal took : 29 ms
[2024-05-23 19:47:46] [INFO ] Applying decomposition
[2024-05-23 19:47:46] [INFO ] Flatten gal took : 28 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/graph11101344332150239114.txt' '-o' '/tmp/graph11101344332150239114.bin' '-w' '/tmp/graph11101344332150239114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11101344332150239114.bin' '-l' '-1' '-v' '-w' '/tmp/graph11101344332150239114.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:47:46] [INFO ] Decomposing Gal with order
[2024-05-23 19:47:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:47:46] [INFO ] Removed a total of 2263 redundant transitions.
[2024-05-23 19:47:46] [INFO ] Flatten gal took : 45 ms
[2024-05-23 19:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1128 labels/synchronizations in 21 ms.
[2024-05-23 19:47:46] [INFO ] Time to serialize gal into /tmp/UpperBounds14536158870779983491.gal : 5 ms
[2024-05-23 19:47:46] [INFO ] Time to serialize properties into /tmp/UpperBounds16340102881398000143.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14536158870779983491.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16340102881398000143.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/UpperBounds16340102881398000143.prop.
ITS-tools command line returned an error code 137
[2024-05-23 20:03:13] [INFO ] Flatten gal took : 33 ms
[2024-05-23 20:03:13] [INFO ] Time to serialize gal into /tmp/UpperBounds17119082154731777246.gal : 14 ms
[2024-05-23 20:03:13] [INFO ] Time to serialize properties into /tmp/UpperBounds15670099187369910295.prop : 9 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/UpperBounds17119082154731777246.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15670099187369910295.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds15670099187369910295.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="FunctionPointer-PT-c064"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c064, 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 r180-tall-171640603100317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c064.tgz
mv FunctionPointer-PT-c064 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;